Errata to: ''Finite Automata and Unary Languages'' - [Theoret. Comput. Sci. 47 (1986) 149-158]

Author： Chrobak M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.302, Iss.1, 2003-06, pp. : 497-498

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

Erratum to ''New upper bounds to the limitedness of distance automata'' - [Theoret. Comput. Sci. 233 (2000) 19-32]

By Hashiguchi K.  

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

Elsevier

Access to resources Recommend Favorite

Corrigendum to ''Expressiveness of matchgates'' - [Theoret. Comput. Sci. 289(1) (2002) 457-471]

By Valiant L.G.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 795-795

Elsevier

Access to resources Recommend Favorite

A -denotational semantics for map theory in ZFC + SI [Theoret. Comput. Sci. 179 (1997) 137-202

By Berline C.   Grue K.  

Theoretical Computer Science, Vol. 211, Iss. 1, 1999-01 ,pp. : 397-398

Elsevier

Access to resources Recommend Favorite

Corrigendum to ''On functions preserving levels of approximation: a refined model construction for various lambda calculi'' [Theoret. Comput. Sci. 212 (1999) 261-303]

By Spreen D.  

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 997-998

Elsevier

Access to resources Recommend Favorite

Minimal cover-automata for finite languages

By Campeanu C.   Santean N.   Yu S.  

Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. : 3-16

Elsevier

Access to resources Recommend Favorite