{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:47:48Z","timestamp":1762458468498},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023771","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:11:10Z","timestamp":1132377070000},"page":"242-256","source":"Crossref","is-referenced-by-count":12,"title":["Towards Kleene Algebra with recursion"],"prefix":"10.1007","author":[{"given":"Haas","family":"Lei\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Finite Automata, Their Algebras and Grammars","author":"J. R. B\u00fcchi","year":"1988","unstructured":"J. R. B\u00fcchi. Finite Automata, Their Algebras and Grammars. Springer Verlag, New York, 1988."},{"key":"18_CR2","volume-title":"Regular Algebra and Finite Machines","author":"J. H. Conway","year":"1971","unstructured":"J. H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S. A. Greibach","year":"1965","unstructured":"S. A. Greibach. A new normal-form theorem for context-free, phrase-structure grammars. Journal of the Association of Computing Machinery, 12:42\u201352, 1965.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"18_CR4","volume-title":"Introduction to Formal Languages","author":"M. Harrison","year":"1978","unstructured":"M. Harrison. Introduction to Formal Languages. Addison Wesley, Reading, Mass., 1978."},{"key":"18_CR5","volume-title":"Formal Languages and their Relation to Automata","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. D. Ullman. Formal Languages and their Relation to Automata. Addison Wesley, Reading, Mass., 1979."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3\u201342. Princeton University Press, 1956.","DOI":"10.1515\/9781400882618-002"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"D. Kozen. On Kleene Algebras and Closed Semirings. In B. Rovan, editor, 15th Int. Symp. on Mathematical Foundations of Computer Science, Bansk\u00e1 Bystrica, 1990, LNCS 452, pages 26\u201347. Springer Verlag, 1990.","DOI":"10.1007\/BFb0029594"},{"key":"18_CR8","volume-title":"A completeness theorem for Kleene algebras and the algebra of regular events","author":"D. Kozen","year":"1991","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In 6th Annual Symposium on Logic in Computer Science, July 15\u201318, 1991, Amsterdam. Computer Society Press, Los Alamitos, CA, 1991."},{"key":"18_CR9","volume-title":"Elements of The Theory of Computation","author":"H. R. Lewis","year":"1981","unstructured":"H. R. Lewis and C. H. Papadimitriou. Elements of The Theory of Computation. Prentice-Hall International, Inc., London, 1981."},{"key":"18_CR10","first-page":"247","volume":"63","author":"D. Niwinski","year":"1984","unstructured":"D. Niwinski. Fixed point characterizations of context-free \u221e-languages. Information and Computation, 63:247\u2013276, 1984.","journal-title":"Information and Computation"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"V. Pratt. Dynamic Algebras as a well-behaved fragment of Relation Algebras. In C.H.Bergmann, R.D.Maddux, and D.L.Pigozzi, editors, Algebraic Logic and Universal Algebra in Computer Science, volume 425 of LNCS. Springer Verlag, 1990.","DOI":"10.1007\/BFb0043079"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"V. Pratt. Action logic and pure induction. In Logic in AI. Proceedings JELIA'90, Univ. of Amsterdam, volume 478 of Lecture Notes in Artificial Intelligence, Subseries of LNCS, pages 97\u2013120. Springer Verlag, 1991.","DOI":"10.1007\/BFb0018436"},{"key":"18_CR13","first-page":"120","volume":"16","author":"V. N. Redko","year":"1964","unstructured":"V. N. Redko. On defining relations for the algebra of regular events (russian). Ukrain. Mat. Z., 16:120\u2013126, 1964.","journal-title":"Ukrain. Mat. Z."},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13:158\u2013169, 1966.","journal-title":"Journal of the ACM"},{"key":"18_CR15","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa. Formal Languages. Academic Press, Inc., New York and London, 1973."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023771.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:50:33Z","timestamp":1607532633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0023771","relation":{},"subject":[]}}