{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:29:46Z","timestamp":1725560986597},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_17","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"195-207","source":"Crossref","is-referenced-by-count":9,"title":["On Logically Defined Recognizable Tree Languages"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Weil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01190713","volume":"27","author":"J. Almeida","year":"1990","unstructured":"Almeida, J.: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics. Algebra Universalis\u00a027, 333\u2013350 (1990)","journal-title":"Algebra Universalis"},{"unstructured":"Arnold, A., Dauchet, M.: Theorie des magmoides. I. and II. (in French), RAIRO Theoretical Informatics and Applications, 12(1978), 235\u2013257, 3(1979), 135\u2013154.","key":"17_CR2"},{"key":"17_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. Springer, Heidelberg (1993)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0022-0000(93)90005-H","volume":"46","author":"J. Cohen","year":"1993","unstructured":"Cohen, J., Pin, J.-E., Perrin, D.: On the expressive power of temporal logic. J. Computer and System Sciences\u00a046, 271\u2013294 (1993)","journal-title":"J. Computer and System Sciences"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs, I. Recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"17_CR7","doi-asserted-by":"crossref","DOI":"10.1201\/9781315273686","volume-title":"Universal Algebra and Applications in Theoretical Computer Science","author":"K. Denecke","year":"2002","unstructured":"Denecke, K., Wismath, S.L.: Universal Algebra and Applications in Theoretical Computer Science. Chapman and Hall, Boca Raton (2002)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53031-2","volume-title":"Combinatorics on Traces","author":"V. Diekert","year":"1990","unstructured":"Diekert, V.: Combinatorics on Traces. LNCS, vol.\u00a0454. Springer, Heidelberg (1990)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. J. Comput. System Sci.\u00a04, 406\u2013451 (1970)","journal-title":"J. Comput. System Sci."},{"key":"17_CR10","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)"},{"key":"17_CR11","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A and B. Academic Press, London (1976 and 1976)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/S0019-9958(67)90670-5","volume":"11","author":"S. Eilenberg","year":"1967","unstructured":"Eilenberg, S., Wright, J.B.: Automata in general algebras. Information and Control\u00a011, 452\u2013470 (1967)","journal-title":"Information and Control"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201351 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"17_CR14","first-page":"711","volume":"54","author":"Z. \u00c9sik","year":"1999","unstructured":"\u00c9sik, Z.: A variety theorem for trees and theories. Publicationes Mathematicae\u00a054, 711\u2013762 (1999)","journal-title":"Publicationes Mathematicae"},{"unstructured":"\u00c9sik, Z., Larsen, K.G.: Regular languages definable by Lindstr\u00f6m quantifiers. Theoretical Informatics and Applications (to appear)","key":"17_CR15"},{"doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: proc.12th ACM Symp. Principles of Programming Languages, Las Vegas, pp. 163\u2013173 (1980)","key":"17_CR16","DOI":"10.1145\/567446.567462"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/BFb0035840","volume-title":"STACS 88","author":"U. Heuter","year":"1988","unstructured":"Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol.\u00a0294, pp. 136\u2013148. Springer, Heidelberg (1988)"},{"unstructured":"Kamp, J.A.: Tense logic and the theory of linear order, Ph. D. Thesis, UCLA (1968)","key":"17_CR18"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1111\/j.1755-2567.1966.tb00600.x","volume":"32","author":"P. Lindstr\u00f6m","year":"1966","unstructured":"Lindstr\u00f6m, P.: First order predicate logic with generalized quantifiers. Theoria\u00a032, 186\u2013195 (1966)","journal-title":"Theoria"},{"key":"17_CR20","volume-title":"Categories for the Working Mathematician","author":"S. MacLane","year":"1971","unstructured":"MacLane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)"},{"key":"17_CR21","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control\u00a011, 3\u201329 (1967)","journal-title":"Information and Control"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"CAAP \u201992","author":"A. Potthoff","year":"1992","unstructured":"Potthoff, A.: Modulo counting quantifiers over finite trees. In: Raoult, J.-C. (ed.) CAAP 1992. LNCS, vol.\u00a0581, Springer, Heidelberg (1992)"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"A. Potthoff","year":"1995","unstructured":"Potthoff, A.: First order logic on finite trees. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, Springer, Heidelberg (1995)"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0022-4049(89)90137-0","volume":"62","author":"J. Rhodes","year":"1989","unstructured":"Rhodes, J., Tilson, B.: The kernel of monoid morphisms. J. Pure and Appl. Alg.\u00a062, 227\u2013268 (1989)","journal-title":"J. Pure and Appl. Alg."},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control\u00a08, 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00010-3","volume":"205","author":"M. Steinby","year":"1998","unstructured":"Steinby, M.: General varieties of tree languages. Theoret. Comput. Sci.\u00a0205, 1\u201343 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"H. Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhauser Boston, Inc., Boston (1994)"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/inco.1995.1067","volume":"118","author":"H. Straubing","year":"1995","unstructured":"Straubing, H., Therien, D., Thomas, W.: Regular languages defined with generalized quantifiers. Information and Computation\u00a0118, 289\u2013301 (1995)","journal-title":"Information and Computation"},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory\u00a02, 57\u201381 (1968)","journal-title":"Math. Systems Theory"},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(95)00131-X","volume":"154","author":"T. Wilke","year":"1996","unstructured":"Wilke, T.: An algebraic characterization of frontier testable tree languages. Theoret. Comput. Sci.\u00a0154, 85\u2013106 (1996)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T21:45:15Z","timestamp":1711662315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}