Abstract
Languages weakly recognized by a Monte Carlo 2-way finite automaton with n states are proved to be strongly recognized by a Monte Carlo 2-way finite automaton with no(n) states. This improves dramatically over the previously known result by M.Karpinski and R.Verbeek which is also nontrivial since these languages can be nonregular. For tally languages the increase in the number of states is proved to be only polynomial, and these languages are regular.
Cite
CITATION STYLE
Ambainis, A., Freivalds, R., & Karpinski, M. (1997). Weak and strong recognition by 2-way randomized automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1269, pp. 175–185). Springer Verlag. https://doi.org/10.1007/3-540-63248-4_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
