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

Author： Hashiguchi K.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

New upper bounds to the limitedness of distance automata

By Hashiguchi K.  

Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. : 19-32

Elsevier

Access to resources Recommend Favorite

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

By Chrobak M.  

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

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

The limitedness problem on distance automata: Hashiguchi's method revisited

By Leung H.   Podolskiy V.  

Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. : 147-158

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