{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:38Z","timestamp":1725489338834},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442400"},{"type":"electronic","value":"9783540457930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45793-3_10","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:03:26Z","timestamp":1187251406000},"page":"135-150","source":"Crossref","is-referenced-by-count":3,"title":["Greibach Normal Form in Algebraically Complete Semirings"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Lei\u03b2","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"L. Aceto, Z. \u00c9sik and A. Ing\u00f3lfsd\u00f3ttir. A fully equational proof of Parikh\u2019s theorem. BRICS Report Series, RS-01-28, Aarhus, 2001.","DOI":"10.7146\/brics.v8i28.21688"},{"key":"10_CR2","unstructured":"J. W. de Bakker and D. Scott. A theory of programs. IBM Seminar, August, 1969."},{"key":"10_CR3","volume-title":"Technical Report","author":"H. Beki\u0107","year":"1969","unstructured":"H. Beki\u0107. Definable operations in general algebra, and the theory of automata and flowcharts. Technical Report, IBM Laboratory, Vienna, 1969."},{"key":"10_CR4","unstructured":"L. Bern\u00e1tsky, S. L. Bloom, Z. \u00c9sik, and Gh. Stefanescu. Equational theories of relations and regular sets, extended abstract. In Proceedings of the Conference on Words, Combinatorics and Semigroups,Kyoto, 1992, pages 40\u201348. World Scientific Publishing Co. Pte. Ltd., 1994."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S0129054192000164","volume":"3","author":"S. L. Bloom","year":"1991","unstructured":"S. L. Bloom and Z. \u00c9sik. Iteration algebras, Int. J. Foundations of Computer Science, 3(1991), 245\u2013302.","journal-title":"Int. J. Foundations of Computer Science"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00c9sik. Iteration Theories, Springer, 1993.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1051\/ita\/1995290605151","volume":"29","author":"M. Boffa","year":"1995","unstructured":"M. Boffa. Une condition impliquant toutes les identit\u00e9s rationnelles. RAIRO Inform. Th\u00e9or. Appl., 29 (1995), 515\u2013518.","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10_CR8","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":"10_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z. \u00c9sik","year":"1997","unstructured":"Z. \u00c9sik. Completeness of Park induction, Theoretical Computer Science, 177 (1997), 217\u2013283.","journal-title":"Theoretical Computer Science"},{"key":"10_CR10","unstructured":"Z. \u00c9sik and W. Kuich. Inductive *-semirings. To appear in Theoretical Computer Science."},{"key":"10_CR11","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. J. of the Association for Computing Machinery, 12 (1965), 42\u201352.","journal-title":"J. of the Association for Computing Machinery"},{"key":"10_CR12","volume-title":"Introduction to Formal Languages","author":"M. Harrison","year":"1978","unstructured":"M. Harrison. Introduction to Formal Languages. Addison Wesley, Reading, 1978."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"M. W. Hopkins and D. Kozen. Parikh\u2019s theorem in commutative Kleene algebra. In Proc. Symp. Logic in Computer Science (LICS\u201999), IEEE Press, 1999, 394\u2013401.","DOI":"10.1109\/LICS.1999.782634"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In 6th Ann. Symp. on Logic in Computer Science, LICS\u201991. Computer Society Press, 1991, 214\u2013225.","DOI":"10.1109\/LICS.1991.151646"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"D. Kozen. On the complexity of reasoning in Kleene algebra. In Proc. 12th Symp. Logic in Computer Science, IEEE Press, 1997, 195\u2013202.","DOI":"10.1109\/LICS.1997.614947"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D. Krob","year":"1991","unstructured":"D. Krob. Complete systems of B-rational identities. Theoret. Comput. Sci., 89 (1991), 207\u2013343.","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR17","series-title":"Lect Notes Comput Sci","first-page":"242","volume-title":"Proc. 5th Workshop on Computer Science Logic, CSL\u2019 91","author":"H. Lei\u03b2","year":"1991","unstructured":"H. Lei\u03b2. Towards Kleene Algebra with Recursion. In Proc. 5th Workshop on Computer Science Logic, CSL\u2019 91. Springer LNCS 626, 242\u2013256, 1991."},{"key":"10_CR18","first-page":"A29","volume":"24","author":"K. C. Ng","year":"1977","unstructured":"K. C. Ng and A. Tarski. Relation algebras with transitive closure. Notices of the American Math. Society, 24:A29\u2013A30, 1977.","journal-title":"Notices of the American Math. Society"},{"key":"10_CR19","series-title":"Lect Notes Comput Sci","first-page":"169","volume-title":"Computation Theory (Zaborow, 1984)","author":"D. Niwinski","year":"1984","unstructured":"D. Niwinski. Equational \u00b5-calculus. In Computation Theory (Zaborow, 1984), pages 169\u2013176, Springer LNCS 208, 1984."},{"key":"10_CR20","series-title":"Lect Notes Comput Sci","first-page":"97","volume-title":"Logics in AI: European Workshop JELIA\u2019 90","author":"V. R. Pratt","year":"1990","unstructured":"V. R. Pratt. Action Logic and Pure Induction. In Logics in AI: European Workshop JELIA\u2019 90. Springer LNCS 478, 97\u2013120, 1990."},{"key":"10_CR21","first-page":"120","volume":"16","author":"V. N. Redko","year":"1964","unstructured":"V. N. Redko. On the determining totality of relations for the algebra of regular events. (Russian) Ukrain. Mat. \u017d., 16 (1964), 120\u2013126.","journal-title":"Ukrain. Mat. \u017d."},{"key":"10_CR22","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/321406.321412","volume":"14","author":"D.J. Rosenkrantz","year":"1967","unstructured":"D.J. Rosenkrantz. Matrix equations and normal forms for context-free grammars. Journal of the Association for Computing Machinery, 14 (1967), 501\u2013507.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10_CR23","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 Association for Computing Machinery, 13 (1966), 158\u2013169.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/3-540-44683-4_56","volume-title":"MFCS 2001","author":"L. Santocanale","year":"2001","unstructured":"L. Santocanale. On the equational definition of the least prefixed point. In MFCS 2001, pages 645\u2013656, Springer LNCS 2136, 2001."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45793-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:34:26Z","timestamp":1556757266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45793-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442400","9783540457930"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45793-3_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}