Abstract
The algebraic approach to formal language and automata theory is a continuation of the earliest traditions in these fields which had sought to represent languages, translations and other computations as expressions (e.g. regular expressions) in suitably-defined algebras; and grammars, automata and transitions as relational and equational systems over these algebras, that have such expressions as their solutions. The possibility of a comprehensive foundation cast in this form, following such results as the algebraic reformulation of the Parikh Theorem, has been recognized by the Applications of Kleene Algebra (AKA) conference from the time of its inception in 2001.
Here, we take another step in this direction by embodying the Chomsky hierarchy, itself, within an infinite complete lattice of algebras that ranges from dioids to quantales, and includes many of the forms of Kleene algebras that have been considered in the literature. A notable feature of this development is the generalization of the Chomsky hierarchy, including type 1 languages, to arbitrary monoids.
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
Hopkins, M.W., Kozen, D.: Parikh’s Theorem in Commutative Kleene Algebra. In: LICS 1999, pp. 394–401 (1999)
Kozen, D.: The Design and Analysis of Algorithms. Springer, Heidelberg (1992)
Kozen, D.: A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Information and Computation 110, 366–390 (1994)
Gunawardena, J. (ed.): Idempotency. Publications of the Newton Institute. Cambridge University Press, Cambridge (1998)
Kozen, D.: On Kleene Algebras and Closed Semirings. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 26–47. Springer, Heidelberg (1990)
Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)
Maslov, V.P., Samborskii, S.N. (eds.): Advances in Soviet Mathematics, vol. 13 (1992)
Abramsky, S., Vickers, S.: Quantales. observational logic and process semantics Mathematical Structures in Computer Science 3, 161–227 (1993)
Vickers, S.: Topology via Logic. In: Cambridge Tracts in Theoretical Computer Science, vol. 5, Cambridge University Press, Cambridge (1989)
Mulvey, C.J.: Quantales. Springer Encyclopaedia of Mathematics (2001)
Baccelli, F., Mairesse, J.: Ergodic theorems for stochastic operators and discrete event systems. In: [4]
Golan, J.S.: Semirings and their applications. Kluwer Academic Publishers, Dordrecht (1999)
Yetter, D.N.: Quantales and (Noncommutative) Linear Logic. J. of Symbolic Logic 55, 41–64 (1990)
Hoeft, H.: A normal form for some semigroups generated by idempotents. Fund. Math. 84, 75–78 (1974)
Paseka, J., Rosicky, J.: Quantales. In: Coecke, B., Moore, D., Wilce, A. (eds.) Current Research in Operational Quantum Logic: Algebras. Categories and Languages. Fund. Theories Phys., vol. 111, pp. 245–262. Kluwer Academic Publishers, Dordrecht (2000)
Birkhoff, G.: Lattice Theory. American Mathematical Society, Providence, RI (1967)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)
Kuroda, S.Y.: Classes of languages and linear bounded automata. Information and Control 7, 203–223 (1964)
Spencer-Brown, G.: Laws of Form. Julian Press and Bantam, New York (1972)
Wood, D.: The Theory of Computation. Harper and Row, New York (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hopkins, M. (2008). The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy. In: Berghammer, R., Möller, B., Struth, G. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2008. Lecture Notes in Computer Science, vol 4988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78913-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-78913-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78912-3
Online ISBN: 978-3-540-78913-0
eBook Packages: Computer ScienceComputer Science (R0)