![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Thiant N.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.303, Iss.2, 2003-07, pp. : 353-374
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)
Domino tiling in planar graphs with regular and bipartite dual
By Chaboud T.
Theoretical Computer Science, Vol. 159, Iss. 1, 1996-05 ,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)
Finding houses and holes in graphs
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Network Security, Vol. 2003, Iss. 11, 2003-11 ,pp. :