Author： Durand B.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.221, Iss.1, 1999-06, pp. : 61-75
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
Quasiperiodicity and string covering
By Iliopoulos C.S. Mouchard L.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Access to resources
Recommend
Tilings: recursivity and regularity
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :
Data structures and algorithms for tilings I
Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. :
Polyomino tilings, cellular automata and codicity
Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,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. :