Abstract
In this paper we present a coinductive definition of context free power series in terms of behavioural differential equations. We show that our coalgebraic approach provides a unified view on many, at first sight different, existing notions of algebraicity, and we apply our behavioural differential equations to produce a new proof for a classical result by Chomsky and Schützenberger, and a simple proof that the zip-operator of two algebraic streams is algebraic.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Allouche, J.-P., Shallit, J.O.: Automatic Sequences – Theory, Applications, Generalizations. Cambridge University Press (2003)
Berstel, J., Reutenauer, C.: Noncommutative Rational Series with Applications. Cambridge University Press (2011)
Ésik, Z., Leiß, H.: Algebraically complete semirings and Greibach normal form. Annals of Pure and Applied Logic 133(1-3), 173–203 (2005)
Fliess, M.: Sur divers produits de sries formelles. Bulletin de la S.M.F. 102, 181–191 (1974)
Nijholt, A.: Context-Free Grammars: Covers, Normal Forms, and Parsing. LNCS, vol. 93. Springer, Heidelberg (1980)
Niqui, M., Rutten, J.: Sampling, Splitting and Merging in Coinductive Stream Calculus. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol. 6120, pp. 310–330. Springer, Heidelberg (2010)
Petre, I., Salomaa, A.: Algebraic systems and pushdown automata. In: Handbook of Weighted Automata, 1st edn., pp. 257–289. Springer (2009)
Rutten, J.: Coinductive counting: bisimulation in enumerative combinatorics. Electr. Notes Theor. Comput. Sci. 65(1), 286–304 (2002)
Rutten, J.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science 308(1-3), 1–53 (2003)
Rutten, J.: A coinductive calculus of streams. Mathematical Structures in Computer Science 15(1), 93–147 (2005)
Winter, J., Bonsangue, M.M., Rutten, J.: Context-Free Languages, Coalgebraically. In: Corradini, A., Klin, B., Cîrstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 359–376. Springer, Heidelberg (2011)
Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing the powerset construction, coalgebraically. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2010. LIPIcs, vol. 8, pp. 272–283 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bonsangue, M.M., Rutten, J., Winter, J. (2012). Defining Context-Free Power Series Coalgebraically. In: Pattinson, D., Schröder, L. (eds) Coalgebraic Methods in Computer Science. CMCS 2012. Lecture Notes in Computer Science, vol 7399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32784-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-32784-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32783-4
Online ISBN: 978-3-642-32784-1
eBook Packages: Computer ScienceComputer Science (R0)