The finite graph problem for two-way alternating automata

Author： Bojanczyk M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.298, Iss.3, 2003-04, pp. : 511-528

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Two-way finite automata with quantum and classical states

By Ambainis A.   Watrous J.  

Theoretical Computer Science, Vol. 287, Iss. 1, 2002-09 ,pp. : 299-311

Elsevier

Access to resources Recommend Favorite

On the power of Las Vegas II: Two-way finite automata

By Hromkovic J.   Schnitger G.  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 1-24

Elsevier

Access to resources Recommend Favorite

Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines

By Ito A.   Inoue K.   Takanami I.   Wang Y.  

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 123-135

Elsevier

Access to resources Recommend Favorite

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. : 189-203

Elsevier

Access to resources Recommend Favorite

Complexity results for two-way and multi-pebble automata and their logics

By Globerman N.   Harel D.  

Theoretical Computer Science, Vol. 169, Iss. 2, 1996-12 ,pp. : 161-184

Elsevier

Access to resources Recommend Favorite