Author： Kim C. Sudborough I.H.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.237, Iss.1, 2000-04, pp. : 183-195
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
Undecidability of existential properties in picture languages
Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. :
Access to resources
Recommend
Recognizable picture languages and domino tiling
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :
Series-parallel languages and the bounded-width property
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,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. :
Two undecidability results for chain code picture languages
By Kim C.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :