{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:28:58Z","timestamp":1761596938619},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642305"},{"type":"electronic","value":"9783540697053"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028581","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:33:39Z","timestamp":1132644819000},"page":"455-465","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Axiomatizing the equational theory of regular tree languages"],"prefix":"10.1007","author":[{"given":"Z.","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01190713","volume":"27","author":"J. Almeida","year":"1990","unstructured":"J. Almeida, On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics, Algebra Universalis, 27 (1990), 333\u2013350.","journal-title":"Algebra Universalis"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"J. Almeida, Finite Semigroups and Universal Algebra, Word Scientific, 1994.","DOI":"10.1142\/2481"},{"key":"39_CR3","first-page":"67","volume":"10","author":"K.V. Archangelsky","year":"1987","unstructured":"K.V. Archangelsky and P.V. Gorshkov, Implicational axioms for the algebra of regular events, Dokl. Akad. Nauk USSR Ser A, 10 (1987), 67\u201369 (in Russian).","journal-title":"Dokl. Akad. Nauk USSR Ser A"},{"key":"39_CR4","volume-title":"Definable operations in general algebras, and the theory of automata and flowcharts","author":"H. Beki\u0109","year":"1969","unstructured":"H. Beki\u0109, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report, IBM Laboratory, Vienna, 1969."},{"key":"39_CR5","unstructured":"L. Bern\u00e1tsky, S.L. Bloom, Z. \u00c9, Gh. Stefanescu, Equational theories of relations and regular sets, in: Words, Languages, and Combinatorics, Kyoto, 1992, Word Scientific, 1994, 40\u201348."},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S0129054192000164","volume":"3","author":"S.L. Bloom","year":"1992","unstructured":"S.L. Bloom and Z. \u00c9sik, Iteration algebras, Int. J. Foundations of Computer Science, 3 (1992), 245\u2013302.","journal-title":"Int. J. Foundations of Computer Science"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129500000104","volume":"3","author":"S.L. Bloom","year":"1993","unstructured":"S.L. Bloom and Z. \u00c9sik, Equational axioms for regular sets, Mathematical Structures in Computer Science, 3 (1993), 1\u201324.","journal-title":"Mathematical Structures in Computer Science"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00c9sik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9_6"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00c9sik, Solving polynomial fixed point equations, in: Mathematical Foundations of Computer Science '94. LNCS 841, Springer-Verlag, 1994, 52\u201367.","DOI":"10.1007\/3-540-58338-6_58"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00248-4","volume":"179","author":"S.L. Bloom","year":"1997","unstructured":"S.L. Bloom and Z. \u00c9sik, The logic of fixed points, Theoretical Computer Science, 179 (1997), 1\u201360.","journal-title":"Theoretical Computer Science"},{"key":"39_CR11","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1990240404191","volume":"24","author":"M. Boffa","year":"1990","unstructured":"M. Boffa, Une remarque sur les systemes complets d'identites rationelles, Theoret. Inform. Appl., 24 (1990), 419\u2013423.","journal-title":"Theoret. Inform. Appl."},{"key":"39_CR12","volume-title":"Regular Algebra and Finite Machines","author":"J.C. Conway","year":"1971","unstructured":"J.C. Conway, Regular Algebra and Finite Machines, Chapman and Hall, London, 1971."},{"key":"39_CR13","first-page":"183","volume":"14","author":"Z. \u00c9sik","year":"1980","unstructured":"Z. \u00c9sik, Identities in iterative and rational algebraic theories, Computational Linguistics and Computer Languages, 14 (1980), 183\u2013207.","journal-title":"Computational Linguistics and Computer Languages"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Z. \u00c9sik, An axiomatization of regular forests in the language of algebraic theories with iteration, in: Fundamentals of Computation Theory, Szeged, 1981, LNCS 117, Springer-Verlag, 130\u2013136.","DOI":"10.1007\/3-540-10854-8_13"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0022-0000(83)90044-2","volume":"27","author":"Z. \u00c9sik","year":"1983","unstructured":"Z. \u00c9sik, Algebras of iteration theories,J. of Computer and System Sciences, 27 (1983), 291\u2013303.","journal-title":"J. of Computer and System Sciences"},{"key":"39_CR16","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":"39_CR17","unstructured":"Z. \u00c9sik, Group axioms for iteration, to appear."},{"key":"39_CR18","unstructured":"Z. \u00c9sik, A variety theorem for trees and theories, LITP Report Series, 97\/15, May 1997."},{"key":"39_CR19","unstructured":"Z. \u00c9sik, Axiomatizing the equational theory of regular tree languages, Stevens Institute of Technology Research Reports, No. 9703, September 1997."},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Z. \u00c9sik and A. Labella, Equational properties of iteration in algebraically complete categories, Theoretical Computer Science, to appear. Extended abstract in: Proc. MFCS '96, LNCS 1113, Springer-Verlag, 1996, 336\u2013247.","DOI":"10.1007\/3-540-61550-4_160"},{"key":"39_CR21","unstructured":"F. G\u00e9cseg and M. Steinby, Tree Automata, Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"39_CR22","unstructured":"F. G\u00e9cseg and M. Steinby, Tree languages, in: Handbook of Formal Languages, vol. 3, eds.: G. Rozenberg and A. Salomaa, Springer-Verlag, 1997, 1\u201368."},{"key":"39_CR23","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"J. Goguen, J. Thatcher, E. Wagner, and J. Wright, Initial algebra semantics and continuous algebras, J. ACM, 24 (1977), 68\u201395.","journal-title":"J. ACM"},{"key":"39_CR24","doi-asserted-by":"crossref","unstructured":"I. Guessarian, Algebraic Semantics, LNCS 99, Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10284-1"},{"key":"39_CR25","unstructured":"A.J.C. Hurkens, M. McArthur, Y.N. Moschovakis, L.S. Moss and G. Whitney, The logic of recursive equations, J. of Symbolic Logic, to appear."},{"key":"39_CR26","unstructured":"T. Ito and S. Ando, A complete axiom system of super-regular expressions, in: Information Processing 74, Amagasaki, Japan, North-Holland, 1974, 661\u2013665."},{"key":"39_CR27","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen, Results on the propositional \u03bc-calculus, Theoretical Computer Science, 27 (1983), 333\u2013354.","journal-title":"Theoretical Computer Science"},{"key":"39_CR28","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, 110 (1994), 366\u2013390.","journal-title":"Information and Computation"},{"key":"39_CR29","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, Theoretical Computer Science, 89 (1991), 207\u2013343.","journal-title":"Theoretical Computer Science"},{"key":"39_CR30","unstructured":"M. Magidor and G. Moran, Finite automata over infinite trees, Technical report No. 30, Hebrew University, 1969."},{"key":"39_CR31","unstructured":"D.M.R. Park, Fixpoint induction and proofs of program properties, in: Machine Intelligence\n                5, D. Michie and B. Meltzer, Eds., Edinburgh Univ. Press, 1970, 59\u201378."},{"key":"39_CR32","first-page":"120","volume":"16","author":"V.N. Redko","year":"1964","unstructured":"V.N. Redko, On the determining totality of relations of an algebra of regular events, Ukrain. Mat. Z., 16 (1964), 120\u2013126 (in Russian).","journal-title":"Mat. Z."},{"key":"39_CR33","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa, Two complete axioms systems for the algebra of regular events, J. of the ACM, 13 (1966), 158\u2013169.","journal-title":"J. of the ACM"},{"key":"39_CR34","unstructured":"M. Steinby, Syntactic algebras and varieties of recognizable sets, in: Proc. Coll. Lille, 1979, 226\u2013240."},{"key":"39_CR35","first-page":"57","volume-title":"A theory of tree language varieties, in: Tree Automata and Languages","author":"M. Steinby","year":"1992","unstructured":"M. Steinby, A theory of tree language varieties, in: Tree Automata and Languages, North-Holland, Amsterdam, 1992, 57\u201381."},{"key":"39_CR36","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"J.W. Thatcher and J.B. Wright, Generalized finite automata theory with an application to a decision problem of second order logic, Mathematical System Theory, 2 (1968), 57\u201381.","journal-title":"Mathematical System Theory"},{"key":"39_CR37","unstructured":"W. Thomas, Logical aspects in the study of tree languages, Ninth Colloq. Trees in Algebra and Programming, Cambridge Univ. Press, 1984, 31\u201349."},{"key":"39_CR38","doi-asserted-by":"crossref","unstructured":"W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Computer Science, vol. B, North-Holland, 1992, 133\u2013191.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"39_CR39","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(95)00131-X","volume":"154","author":"T. Wilke","year":"1996","unstructured":"Th. Wilke, An algebraic characterization of frontier testable languages, Theoretical Computer Science, 154 (1996), 85\u2013106.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 98"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:40:21Z","timestamp":1578537621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028581"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642305","9783540697053"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/bfb0028581","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"20 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}