Author： Kim C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.270, Iss.1, 2002-01, pp. : 969-976
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
Improved matrix pair undecidability results
By Halava Vesa Hirvensalo Mika
Acta Informatica, Vol. 44, Iss. 3-4, 2007-07 ,pp. :
Leftmove-bounded picture languages
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
Some undecidability results concerning the property of preserving regularity
By Otto F.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Undecidability Results for Low Complexity Time Classes
Journal of Computer and System Sciences, Vol. 60, Iss. 2, 2000-04 ,pp. :