Abstract
Premorphisms are monotonic mappings between partially ordered monoids where the morphism condition ϕ(x y) = ϕ(x) ϕ(y) is relaxed into the condition ϕ(xy) ≤ ϕ(x) ϕ(y). Their use in place of morphisms has recently been advocated in situations where classical algebraic recognizability collapses. With languages of overlapping tiles, an extension of classical recognizability by morphisms, called quasi-recognizability, has already proved both its effectiveness and its power. In this paper, we complete the theory of such tile languages by providing a notion of (finite state) non deterministic tile automata that capture quasi-recognizability in the sense that quasi-recognizable languages correspond to finite boolean combinations of languages recognizable by finite state non deterministic tile automata. As a consequence, it is also shown that quasi-recognizable languages of tiles correspond to finite boolean combination of upward closed (in the natural order) languages of tiles definable in Monadic Second Order logic.
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
Berthaut, F., Janin, D., Martin, B.: Advanced synchronization of audio or symbolic musical patterns: an algebraic approach. International Journal of Semantic Computing 6(4), 1–19 (2012)
Cornock, C.: Restriction Semigroups: Structure, Varieties and Presentations. PhD thesis, Departement of Mathematics University of York (2011)
Cornock, C., Gould, V.: Proper two-sided restriction semigroups and partial actions. Journal of Pure and Applied Algebra 216, 935–949 (2012)
Dicky, A., Janin, D.: Two-way automata and regular languages of overlapping tiles. Technical Report RR-1463-12, LaBRI, Université de Bordeaux (2012)
Fountain, J.: Adequate semigroups. Proc. Edinburgh Math. Soc. 22(2), 113–125 (1979)
Hollings, C.D.: The Ehresmann ScheinNambooripad Theorem and its successors. European Journal of Pure and Applied Mathematics 5(4), 414–450 (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.: Algebras, automata and logic for languages of labeled birooted trees. Technical Report RR-1467-13, LaBRI, Université de Bordeaux (2013)
Janin, D.: 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. LNCS, vol. 7741, pp. 244–256. Springer, Heidelberg (2013)
Janin, D., Berthaut, F., DeSainte-Catherine, M., Orlarey, Y., Salvati, S.: The T-calculus: towards a structured programming of (musical) time and space. Technical Report RR-1466-13, LaBRI, Université de Bordeaux, (to appear, 2013)
Kellendonk, J.: The local structure of tilings and their integer group of coinvariants. Comm. Math. Phys. 187, 115–157 (1997)
Kellendonk, J., Lawson, M.V.: Universal groups for point-sets and tilings. Journal of Algebra 276, 462–492 (2004)
Lawson, M.V.: Semigroups and ordered categories. i. the reduced case. Journal of Algebra 141(2), 422–462 (1991)
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)
Pin, J.-E.: Syntactic semigroups. In: Handbook of formal languages, vol. I, ch. 10, pp. 679–746. Springer (1997)
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). Overlapping Tile Automata. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-38536-0_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38535-3
Online ISBN: 978-3-642-38536-0
eBook Packages: Computer ScienceComputer Science (R0)