Author： Ambainis A. Watrous J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.287, Iss.1, 2002-09, pp. : 299-311
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The finite graph problem for two-way alternating automata
By Bojanczyk M.
Theoretical Computer Science, Vol. 298, Iss. 3, 2003-04 ,pp. :
Access to resources
Recommend
On the power of Las Vegas II: Two-way finite automata
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
Converting two-way nondeterministic unary automata into simpler automata
By Geffert V. Mereghetti C. Pighizzini G.
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
Complexity results for two-way and multi-pebble automata and their logics
Theoretical Computer Science, Vol. 169, Iss. 2, 1996-12 ,pp. :