Abstract
We give a coalgebraic account of context-free languages using the functor \({\mathcal D}(X) = 2 \times X^A\) for deterministic automata over an alphabet A, in three different but equivalent ways: (i) by viewing context-free grammars as \({\mathcal D}\)-coalgebras; (ii) by defining a format for behavioural differential equations (w.r.t. \({\mathcal D}\)) for which the unique solutions are precisely the context-free languages; and (iii) as the \({\mathcal D}\)-coalgebra of generalized regular expressions in which the Kleene star is replaced by a unique fixed point operator. In all cases, semantics is defined by the unique homomorphism into the final coalgebra of all languages, paving the way for coinductive proofs of context-free language equivalence. Furthermore, the three characterizations can serve as the basis for the definition of a general coalgebraic notion of context-freeness, which we see as the ultimate long-term goal of the present study.
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
Bartels, F.: On Generalized Coinduction and Probabilistic Specification Formats. Ph.D. thesis. Vrije Universiteit Amsterdam (2004)
Ésik, Z., Leiß, H.: Algebraically complete semirings and Greibach normal form. Annals of Pure and Applied Logic 133(1-3), 173–203 (2005)
Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. J. ACM 9, 350–371 (1962)
Greibach, S.A.: A new normal-form theorem for context-free, phrase structure grammars. Journal of the Association for Computing Machinery 12, 42–52 (1965)
Hasuo, I., Jacobs, B.: Context-free languages via coalgebraic trace semantics. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 213–231. Springer, Heidelberg (2005)
Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Addison-Wesley Longman Publishing Co., Inc., Boston (1969)
Jacobs, B.: A bialgebraic review of deterministic automata, regular expressions and languages. In: Futatsugi, K., Jouannaud, J.-P., Bevilacqua, V. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 375–404. Springer, Heidelberg (2006)
Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366–390 (1994)
Leiß, H.: Towards Kleene algebra with recursion. In: Kleine Büning, H., Jäger, G., Börger, E., Richter, M.M. (eds.) CSL 1991. LNCS, vol. 626, pp. 242–256. Springer, Heidelberg (1992)
Linz, P.: An Introduction to Formal Languages and Automata. Jones and Bartlett (1997)
Milius, S.: A sound and complete calculus for finite stream circuits. In: LICS 2010, Edinburgh, United Kingdom, July 11-14, pp. 421–430. IEEE Computer Society, Los Alamitos (2010)
Rutten, J.J.M.M.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 194–218. Springer, Heidelberg (1998)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)
Rutten, J.J.M.M.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science 308(1-3), 1–53 (2003)
Silva, A.: Kleene Coalgebra. Ph.D. thesis. Radboud Universiteit Nijmegen (2010)
Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing the powerset construction, coalgebraically. In: FSTTCS. LIPIcs, vol. 8, pp. 272–283. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
Silva, A., Bonsangue, M.M., Rutten, J.J.M.M.: Non-deterministic Kleene coalgebras. Logical Methods in Computer Science 6(3) (2010)
Stirling, C.: Decidability of DPDA equivalence. Theoretical Computer Science 255(1-2), 1–31 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Winter, J., Bonsangue, M.M., Rutten, J. (2011). Context-Free Languages, Coalgebraically. In: Corradini, A., Klin, B., Cîrstea, C. (eds) Algebra and Coalgebra in Computer Science. CALCO 2011. Lecture Notes in Computer Science, vol 6859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22944-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-22944-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22943-5
Online ISBN: 978-3-642-22944-2
eBook Packages: Computer ScienceComputer Science (R0)