Abstract
A one-dimensional tile with overlaps is a standard finite word that carries some more information that is used to say when the concatenation of two tiles is legal. Known since the mid 70’s in the rich mathematical field of inverse monoid theory, this model of tiles with the associated partial product have yet not been much studied in theoretical computer science despite some implicit appearances in studies of two-way automata in the 80’s.
In this paper, after giving an explicit description of McAlister monoid, we define and study several classical classes of languages of tiles: from recognizable languages (REC) definable by morphism into finite monoids up to languages definable in monadic second order logic (MSO).
We show that the class of MSO definable languages of tiles is both simple: these languages are finite sums of Cartesian products of rational languages, and robust: the class is closed under product, iterated product (star), inverse and projection on context tiles. A equivalent notion of extended regular expression is deduced from these results.
The much smaller class of REC recognizable languages of tiles is then studied. We describe few examples and we prove that these languages are tightly linked with covers of periodic bi-infinite words.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Almeida, F.S.: Algebraic Aspects of Tiling Semigroups. PhD thesis, Universidade de Lisboa, Faculdade de Ciências Departamento de Matemática (2010)
Berthaut, F., Janin, D., Martin, B.: Advanced synchronization of audio or symbolic musical patterns. In: Sixth IEEE International Conference on Semantic Computing, pp. 202–209. IEEE Society Press (2012)
Dicky, A., Janin, D.: Two-way automata and regular languages of overlapping tiles. Technical Report RR-1463-12, LaBRI, Université de Bordeaux (2012)
Janin, D.: Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 516–528. Springer, Heidelberg (2012)
Janin, D.: Vers une modélisation combinatoire des structures rythmiques simples de la musique. Revue Francophone d’Informatique Musicale (RFIM), 2 (to appear, 2012)
Kellendonk, J.: The local structure of tilings and their integer group of coinvariants. Comm. Math. Phys. 187, 115–157 (1997)
Lawson, M.V.: Inverse Semigroups: The theory of partial symmetries. World Scientific (1998)
Lawson, M.V.: McAlister semigroups. Journal of Algebra 202(1), 276–294 (1998)
Margolis, S.W., Pin, J.-E.: Languages and Inverse Semigroups. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 337–346. Springer, Heidelberg (1984)
Munn, W.D.: Free inverse semigroups. Proceeedings of the London Mathematical Society 29(3), 385–404 (1974)
Pécuchet, J.-P.: Automates boustrophedon, semi-groupe de birget et monoide inversif libre. ITA 19(1), 71–100 (1985)
Silva, P.V.: On free inverse monoid languages. ITA 30(4), 349–378 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janin, D. (2013). On Languages of One-Dimensional Overlapping Tiles. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds) SOFSEM 2013: Theory and Practice of Computer Science. SOFSEM 2013. Lecture Notes in Computer Science, vol 7741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35843-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-35843-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35842-5
Online ISBN: 978-3-642-35843-2
eBook Packages: Computer ScienceComputer Science (R0)