{"title":"One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata","authors":"K. Balodis","doi":"10.1007/978-3-642-40164-0_7","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Fundamentals of Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-40164-0_7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}