Consistency of multidimensional combinatorial substitutions




Jolivet T, Kari J

PublisherELSEVIER SCIENCE BV

2012

Theoretical Computer Science

THEORETICAL COMPUTER SCIENCE

THEOR COMPUT SCI

454

178

188

11

0304-3975

DOIhttps://doi.org/10.1016/j.tcs.2012.03.050



We prove that it is undecidable whether a two-dimensional substitution is consistent or overlapping, and we provide practical algorithms to decide these properties in some particular cases. (C) 2012 Elsevier B.V. All rights reserved.



Last updated on 2024-26-11 at 23:52