Consistency of multidimensional combinatorial substitutions

From MaRDI portal
Publication:714822

DOI10.1007/978-3-642-30642-6_20zbMATH Open1280.68150DBLPjournals/tcs/JolivetK12arXiv1112.1841OpenAlexW2059456690WikidataQ62045910 ScholiaQ62045910MaRDI QIDQ714822FDOQ714822


Authors: Timo Jolivet, Jarkko Kari Edit this on Wikidata


Publication date: 11 October 2012

Published in: Theoretical Computer Science, Computer Science – Theory and Applications (Search for Journal in Brave)

Abstract: Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in mathbbZd. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of the way they are glued together in the image by a substitution. Two problems can arise when defining a substitution in such a way: it can fail to be consistent, and the patterns in an image by the substitution might overlap. 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.


Full work available at URL: https://arxiv.org/abs/1112.1841




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Consistency of multidimensional combinatorial substitutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714822)