Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra

Author： Muller D.E.   Schupp P.E.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.141, Iss.1, 1995-04, pp. : 69-107

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

Finite nondeterministic automata: Simulation and minimality

By Calude C.S.   Calude E.   Khoussainov B.  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 219-235

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

McNaughton families of languages

By Beaudry M.   Holzer M.   Niemann G.   Otto F.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1581-1628

Elsevier

Access to resources Recommend Favorite

New Approach of Diagnosis by Timed Automata

By  

International Journal of Ambient Computing and Intelligence (IJACI), Vol. 8, Iss. 3, 2017-07 ,pp. : 76-93

IGI Global_journal

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