Abstract
First we recall the work of Suschkewitsch (1929) about the generalization of the associative law which is the starting point of the theory of quasigroups. Then we show that it is a particular case of the notion of relative associativity introduced by Roubaud in 1965. Thereafter we prove a coherence theorem over an infinite set of nonassociative operations. This result contains all the uppermentioned contributions. This allows to obtain a very general à-la-Kleene theorem on rational series which uses concatenations that can be associative or not.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ackél, J.: Lectures on Functional Equations and their Applications. Academic Press, New-York (1966)
Ackél, J., Hosszú, M.: On transformations with several parameters and operations in multidimensional spaces. Acta Math. Acad. Sci. Hungaricae 7, 327–338 (1956)
d’Adhémar, C.: Quelques classes de groupoídes non-associatifs. Math. Sci. Hum. 31, 17–31 (1970)
Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleene’s theorem. Inform. Process. Lett. 24, 1–4 (1987)
Berstel, J., Reutenauer, C.: Rational Series and their Langages. In: EATCS Monographs on Theoretical Computer Science, vol. 12, Springer, Heidelberg (1988)
Bozapalidis, S.: Context-free series on trees. Inform. Comput. 169, 186–229 (2001)
Gécseg, F., Steinby, M.: Tree Languages. In: Rosenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 1–68. Springer, Heidelberg (1997)
Germain, C., Pallo, J.: Langages rationnels définis avec une concaténation non-associative. Theor. Comput. Sci. 233, 217–231 (2000)
Germain, C., Pallo, J.: Linear languages with a nonassociative concatenation. J. Autom. Lang. Comb. 7, 311–320 (2002)
Harris, Z.: A Theory of Language and Information: a Mathematical Approach. Oxford University Press, Oxford (1991)
Hausmann, B.A., Ore, O.: Theory of quasigroups. Amer. J. Math. 59, 983–1004 (1937)
Kostrikin, A.L., Shafarevich, I.R. (eds.): Algebra VI. Encyclopaedia of Mathematical Sciences, vol. 57. Springer, Heidelberg (1995)
Kuich, W.: Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata. In: Rosenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol. 1, pp. 609–677. Springer, Heidelberg (1997)
Kunen, K.: Quasigroups, loops and associative laws. J. Algebra 185, 194–204 (1996)
Lõhmus, J.: Preface to the Special Issue on Nonassociative Algebras, Quasigroups and Applications in Physics. Acta Applic. Math. 50, 1–2 (1998)
L\~{o}hmus, J., Paal, E., Sorgsepp, L.: About nonassociativity in mathematics and physics. Acta Applic. Math. 50, 3–31 (1998)
Mac Lane, S.: Natural associativity and commutativity. Rice Univ. Stud. 49, 28–46 (1963)
Mac Lane, S.: Preface to ”Coherence in Categories”. Lecture Notes in Math., vol. 281. Springer, Heidelberg (1970)
Murdoch, D.C.: Quasigroups which satisfy certain generalized associative law. Amer. J. Math. 61, 509–522 (1939)
Pallo, J.M.: Word problem in distributive magmas. Fund. Inform. 4, 957–973 (1981)
Pallo, J.M.: Modéles associatif-relatif et commutatif cohérents appliqués aux langages réguliers. Calcolo 19, 289–300 (1982)
Pallo, J.M.: Coding binary trees by embedding into the Roubaud’s magma. Rad. Mat. 2, 21–34 (1986)
Pallo, J.M.: The rotation χ-lattice of ternary trees. Computing 66, 297–308 (2001)
Pallo, J.M.: Generating binary trees by Glivenko classes on Tamari lattices. Inform. Process. Lett. 85, 235–238 (2003)
Pallo, J.M.: Permutoassociaédres d’arbres binaires étiquetés. Rad. Mat. 13, 5–14 (2004)
Pflugfelder, H.O.: Historical notes on loop theory. Comment. Math. Univ. Carolinae 41, 359–370 (2000)
Roubaud, J.: Types d’A-algèbres discrètes complètes: un théorème des fonctions implicites. C. R. Acad. Sc. Paris 261, 3005–3007 (1965)
Roubaud, J.: Sur un théorème de M. P. Schützenberger. C. R. Acad. Sc. Paris 261, 3265–3267 (1965)
Roubaud, J.: La notion d’associativité relative. Math. Sci. Hum. 34, 43–59 (1970)
Sade, A.: Théorie des systèmes demosiens de groupoïdes. Pacific J. Math. 10, 625–660 (1960)
Sade, A.: Groupoïdes en relation associative et semigroupes. Ann. Soc. Sc. Bruxelles 75, 52–57 (1961)
Salomaa, A.: Formal Languages and Power Series. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 103–132. Elsevier, Amsterdam (1990)
Suschkewitsch, A.: On a generalization of the associative law. Trans. Amer. Math. Soc. 31, 204–214 (1929)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pallo, JM. (2007). Nonassociativity à la Kleene. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2007. Lecture Notes in Computer Science, vol 4728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75414-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-75414-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75413-8
Online ISBN: 978-3-540-75414-5
eBook Packages: Computer ScienceComputer Science (R0)