McNaughton families of languages

Author： Beaudry M.   Holzer M.   Niemann G.   Otto F.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

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

By Muller D.E.   Schupp P.E.  

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

Elsevier

Access to resources Recommend Favorite

Families of locally testable languages

By Caron P.  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 361-376

Elsevier

Access to resources Recommend Favorite

Algebraic aspects of families of fuzzy languages

By Asveld P.R.J.  

Theoretical Computer Science, Vol. 293, Iss. 2, 2003-02 ,pp. : 417-445

Elsevier

Access to resources Recommend Favorite

A hierarchy of eNCE families of graph languages

By Kim C.  

Theoretical Computer Science, Vol. 186, Iss. 1, 1997-10 ,pp. : 157-169

Elsevier

Access to resources Recommend Favorite

Mango Languages

By Jeske Michelle  

The Charleston Advisor, Vol. 10, Iss. 3, 2009-01 ,pp. : 50-51

The Charleston Company

Access to resources Recommend Favorite