Author： Latteux M. Simplot D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.178, Iss.1, 1997-05, pp. : 275-283
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
A characterization of recognizable picture languages by tilings by finite sets
By Simplot D.
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :
Access to resources
Recommend
Recognizable languages in concurrency monoids
By Droste M.
Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. :
Domino tiling in planar graphs with regular and bipartite dual
By Chaboud T.
Theoretical Computer Science, Vol. 159, Iss. 1, 1996-05 ,pp. :
Leftmove-bounded picture languages
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :