{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T14:09:00Z","timestamp":1790431740807,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229435","type":"print"},{"value":"9783642229442","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22944-2_25","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T05:45:59Z","timestamp":1314251159000},"page":"359-376","source":"Crossref","is-referenced-by-count":9,"title":["Context-Free Languages, Coalgebraically"],"prefix":"10.1007","author":[{"given":"Joost","family":"Winter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcello M.","family":"Bonsangue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Rutten","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Bartels, F.: On Generalized Coinduction and Probabilistic Specification Formats. Ph.D. thesis. Vrije Universiteit Amsterdam (2004)"},{"issue":"1-3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.apal.2004.10.008","volume":"133","author":"Z. \u00c9sik","year":"2005","unstructured":"\u00c9sik, Z., Lei\u00df, H.: Algebraically complete semirings and Greibach normal form. Annals of Pure and Applied Logic\u00a0133(1-3), 173\u2013203 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. J. ACM\u00a09, 350\u2013371 (1962)","journal-title":"J. ACM"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S.A. Greibach","year":"1965","unstructured":"Greibach, S.A.: A new normal-form theorem for context-free, phrase structure grammars. Journal of the Association for Computing Machinery\u00a012, 42\u201352 (1965)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11548133_14","volume-title":"Algebra and Coalgebra in Computer Science","author":"I. Hasuo","year":"2005","unstructured":"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.\u00a03629, pp. 213\u2013231. Springer, Heidelberg (2005)"},{"key":"25_CR6","volume-title":"Formal languages and their relation to automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Addison-Wesley Longman Publishing Co., Inc., Boston (1969)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11780274_20","volume-title":"Algebra, Meaning, and Computation","author":"B. Jacobs","year":"2006","unstructured":"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.\u00a04060, pp. 375\u2013404. Springer, Heidelberg (2006)"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput.\u00a0110(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0023771","volume-title":"Computer Science Logic","author":"H. Lei\u00df","year":"1992","unstructured":"Lei\u00df, H.: Towards Kleene algebra with recursion. In: Kleine B\u00fcning, H., J\u00e4ger, G., B\u00f6rger, E., Richter, M.M. (eds.) CSL 1991. LNCS, vol.\u00a0626, pp. 242\u2013256. Springer, Heidelberg (1992)"},{"key":"25_CR10","unstructured":"Linz, P.: An Introduction to Formal Languages and Automata. Jones and Bartlett (1997)"},{"key":"25_CR11","first-page":"421","volume-title":"LICS 2010","author":"S. Milius","year":"2010","unstructured":"Milius, S.: A sound and complete calculus for finite stream circuits. In: LICS 2010, Edinburgh, United Kingdom, July 11-14, pp. 421\u2013430. IEEE Computer Society, Los Alamitos (2010)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J.J.M.M. Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 194\u2013218. Springer, Heidelberg (1998)"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00895-2","volume":"308","author":"J.J.M.M. Rutten","year":"2003","unstructured":"Rutten, J.J.M.M.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science\u00a0308(1-3), 1\u201353 (2003)","journal-title":"Theoretical Computer Science"},{"key":"25_CR15","unstructured":"Silva, A.: Kleene Coalgebra. Ph.D. thesis. Radboud Universiteit Nijmegen (2010)"},{"key":"25_CR16","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing the powerset construction, coalgebraically. In: FSTTCS. LIPIcs, vol.\u00a08, pp. 272\u2013283. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Silva, A., Bonsangue, M.M., Rutten, J.J.M.M.: Non-deterministic Kleene coalgebras. Logical Methods in Computer Science\u00a06(3) (2010)","DOI":"10.2168\/LMCS-6(3:23)2010"},{"issue":"1-2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00389-3","volume":"255","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Decidability of DPDA equivalence. Theoretical Computer Science\u00a0255(1-2), 1\u201331 (2001)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22944-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:39:39Z","timestamp":1620041979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22944-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229435","9783642229442"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22944-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}