Abstract
In this paper, we study languages of finite and infinite birooted words. We show how the embedding of free ω-semigroups of finite and infinite words into the monoid of birooted words can be generalized to the embedding of two-sorted ω-semigroups into (some notion of) one-sorted ordered ω-monoids. This leads to an algebraic characterization of regular languages of finite and infinite birooted words that generalizes and unifies the known algebraic characterizations of regular languages of finite and 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
Berthaut, F., Janin, D., Martin, B.: Advanced synchronization of audio or symbolic musical patterns: an algebraic approach. International Journal of Semantic Computing 6(4), 409–427 (2012), http://hal.archives-ouvertes.fr/hal-00794196
Blumensath, A.: Recognisability for algebras of infinite trees. Theoretical Comp. Science 412(29), 3463–3486 (2011)
Dicky, A., Janin, D.: Two-way automata and regular languages of overlapping tiles. Research report RR-1463-12, LaBRI, Université de Bordeaux (2013), http://hal.archives-ouvertes.fr/hal-00717572
Dubourg, E., Janin, D.: Algebraic tools for the overlapping tile product. In: Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 335–346. Springer, Heidelberg (2014), http://hal.archives-ouvertes.fr/hal-00879465
Fountain, J., Gomes, G., Gould, V.: A Munn type representation for a class of E-semiadequate semigroups. Journal of Algebra 218, 693–714 (1999)
Fountain, J., Gomes, G., Gould, V.: The free ample monoid. Int. Jour. of Algebra and Computation 19, 527–554 (2009)
Hudak, P.: A sound and complete axiomatization of polymorphic temporal media. Tech. Rep. RR-1259, Department of Computer Science, Yale University (2008)
Hudak, P., Hugues, J., Peyton Jones, S., Wadler, P.: A history of Haskell: Being lazy with class. In: Third ACM SIGPLAN History of Programming Languages (HOPL). ACM Press (2007)
Hudak, P., Janin, D.: Tiled polymorphic temporal media. Research report RR-1478-14, LaBRI, Université de Bordeaux (2014), http://hal.archives-ouvertes.fr/hal-00955113
Janin, D.: Quasi-inverse monoids (and premorphisms). Research report RR-1459-12, LaBRI, Université de Bordeaux (2012), http://hal.archives-ouvertes.fr/hal-00673123
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), http://hal.archives-ouvertes.fr/hal-00671917
Janin, D.: Algebras, automata and logic for languages of labeled birooted trees. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 312–323. Springer, Heidelberg (2013), http://hal.archives-ouvertes.fr/hal-00784898
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), http://hal.archives-ouvertes.fr/hal-00659202
Janin, D.: Overlapping tile automata. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 431–443. Springer, Heidelberg (2013)
Janin, D.: On languages of labeled birooted trees: Algebras, automata and logic. Information and Computation (in print, 2014), http://hal.archives-ouvertes.fr/hal-00982538
Janin, D.: Towards a higher dimensional string theory for the modeling of computerized systems. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 7–20. Springer, Heidelberg (2014)
Janin, D., Berthaut, F., DeSainte-Catherine, M., Orlarey, Y., Salvati, S.: The T-calculus : towards a structured programming of (musical) time and space. In: ACM Workshop on Functional Art, Music, Modeling and Design (FARM), pp. 23–34. ACM Press (2013), http://hal.archives-ouvertes.fr/hal-00789189
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.: Tiling semigroups. Journal of Algebra 224(1), 140–150 (2000)
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)
McAlister, D.: Inverse semigroups which are separated over a subsemigroups. Trans. Amer. Math. Soc. 182, 85–117 (1973)
Muller, D.: Infinite sequences and finite machines. In: Fourth Annual Symp. IEEE, Switching Theory and Logical Design, pp. 3–16 (1963)
Perrin, D., Pin, J.E.: Infinite Words: Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol. 141. Elsevier (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Dicky, A., Janin, D. (2014). Embedding Finite and Infinite Words into Overlapping Tiles. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-09698-8_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09697-1
Online ISBN: 978-3-319-09698-8
eBook Packages: Computer ScienceComputer Science (R0)