Author： Robilliard D. Simplot D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.233, Iss.1, 2000-02, pp. : 51-74
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
Two undecidability results for chain code picture languages
By Kim C.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Access to resources
Recommend
Leftmove-bounded picture languages
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
Recognizable picture languages and domino tiling
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :
A characterization of recognizable picture languages by tilings by finite sets
By Simplot D.
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :
Error-detecting properties of languages
By Konstantinidis S. O'Hearn A.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :