Author： Ito A. Inoue K. Takanami I. Wang Y.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.143, Iss.1, 1995-07, pp. : 123-135
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
Finite nondeterministic automata: Simulation and minimality
By Calude C.S. Calude E. Khoussainov B.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-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. :
On the simulation of quantum turing machines
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
Two-way finite automata with quantum and classical states
Theoretical Computer Science, Vol. 287, Iss. 1, 2002-09 ,pp. :