![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Simplot D.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.218, Iss.2, 1999-05, pp. : 297-323
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Recognizable picture languages and domino tiling
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Recognizable languages in concurrency monoids
By Droste M.
Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On iterating linear transformations over recognizable sets of integers
By Boigelot B.
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Leftmove-bounded picture languages
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Index Sets in Modeling Languages
By Hürlimann T.
Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. :