{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:06Z","timestamp":1725497166883},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754138"},{"type":"electronic","value":"9783540754145"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-75414-5_12","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T06:22:54Z","timestamp":1196922174000},"page":"189-207","source":"Crossref","is-referenced-by-count":2,"title":["Aperiodicity in Tree Automata"],"prefix":"10.1007","author":[{"given":"Zoltan","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_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"},{"key":"12_CR2","first-page":"1","volume":"13","author":"L. Bern\u00e1tsky","year":"1997","unstructured":"Bern\u00e1tsky, L.: Regular expression star-freeness is PSPACE-complete. Acta Cybernetica\u00a013, 1\u201321 (1997)","journal-title":"Acta Cybernetica"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(91)90075-D","volume":"88","author":"S. Cho","year":"1991","unstructured":"Cho, S., Huynh, D.T.: Finite-automaton aperiodicity is PSPACE-complete. Theoretical Computer Science\u00a088, 99\u2013116 (1991)","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A&B. Academic Press, London (1974)"},{"key":"12_CR5","first-page":"243","volume":"48","author":"Z. \u00c9sik","year":"1996","unstructured":"\u00c9sik, Z.: Definite tree automata and their cascade compositions. Publ. Math.\u00a048, 243\u2013262 (1996)","journal-title":"Publ. Math."},{"key":"12_CR6","unstructured":"\u00c9sik, Z.: An algebraic characterization of temporal logics on finite trees. Parts I, II, III. In: 1st International Conference on Algebraic Informatics, 2005, pp. 53\u201377, 79\u201399, 101\u2013110, Aristotle Univ. Thessaloniki, Thessaloniki (2005)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tcs.2006.01.034","volume":"356","author":"Z. \u00c9sik","year":"2006","unstructured":"\u00c9sik, Z.: Characterizing CTL-like logics on finite trees. Theoretical Computer Science\u00a0356, 136\u2013152 (2006)","journal-title":"Theoretical Computer Science"},{"key":"12_CR8","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"12_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal Algebra","author":"G. Gr\u00e4tzer","year":"1979","unstructured":"Gr\u00e4tzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)","edition":"2"},{"key":"12_CR10","first-page":"137","volume":"35","author":"U. Heuter","year":"1988","unstructured":"Heuter, U.: Definite tree languages. Bulletin of the EATCS\u00a035, 137\u2013142 (1988)","journal-title":"Bulletin of the EATCS"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1051\/ita\/1991250201251","volume":"25","author":"U. Heuter","year":"1991","unstructured":"Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. RAIRO Inform. Th\u00e9or. Appl.\u00a025, 125\u2013145 (1991)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"12_CR12","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, Cambridge, MA (1971)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(94)90270-4","volume":"126","author":"A. Potthoff","year":"1994","unstructured":"Potthoff, A.: Modulo-counting quantifiers over finite trees. Theoretical Computer Science\u00a0126, 97\u2013112 (1994)","journal-title":"Theoretical Computer Science"},{"key":"12_CR14","unstructured":"Steinby, M.: A theory of tree language varieties. In: Tree Automata and Languages, North-Holland, Amsterdam, pp. 57\u201381 (1992)"},{"key":"12_CR15","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. Theoretical Computer Science\u00a0205, 1\u201343 (1998)","journal-title":"Theoretical Computer Science"},{"key":"12_CR16","first-page":"31","volume-title":"Ninth colloquium on trees in algebra and programming (Bordeaux, 1984)","author":"W. Thomas","year":"1984","unstructured":"Thomas, W.: Logical aspects in the study of tree languages. In: Ninth colloquium on trees in algebra and programming (Bordeaux, 1984), pp. 31\u201349. Cambridge Univ. Press, Cambridge (1984)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75414-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T00:36:17Z","timestamp":1684110977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75414-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540754138","9783540754145"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75414-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}