{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:18:15Z","timestamp":1781893095605,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029295","type":"print"},{"value":"9783642029301","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_24","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"285-296","source":"Crossref","is-referenced-by-count":3,"title":["A Decidable Characterization of Locally Testable Tree Languages"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Place","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luc","family":"Segoufin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ipl.2007.05.015","volume":"104","author":"M. Boja\u0144czyk","year":"2007","unstructured":"Boja\u0144czyk, M.: A new algorithm for testing if a regular language is locally threshold testable. Inf. Process. Lett.\u00a0104(3), 91\u201394 (2007)","journal-title":"Inf. Process. Lett."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M.: Two-way unary temporal logic over trees. In: IEEE Symposium on Logic in Computer Science (LICS), pp. 121\u2013130 (2007)","DOI":"10.1109\/LICS.2007.51"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BFb0035752","volume-title":"Automata, Languages and Programming","author":"D. Beauquier","year":"1989","unstructured":"Beauquier, D., Pin, J.-E.: Factors of words. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 63\u201379. Springer, Heidelberg (1989)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"J.A. Brzozowski","year":"1973","unstructured":"Brzozowski, J.A., Simon, I.: Characterizations of locally testable languages. Discrete Math.\u00a04, 243\u2013271 (1973)","journal-title":"Discrete Math."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-70583-3_20","volume-title":"Automata, Languages and Programming","author":"M. Boja\u0144czyk","year":"2008","unstructured":"Boja\u0144czyk, M., Segoufin, L.: Tree languages defined in first-order logic with one quantifier alternation. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 233\u2013245. Springer, Heidelberg (2008)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Segoufin, L.: Regular languages definable in FO and FOmod. In: ACM Trans. of Computational Logic (to appear, 2009)","DOI":"10.1145\/1614431.1614435"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Segoufin, L., Straubing, H.: Piecewise testable tree languages. In: IEEE Symposium on Logic in Computer Science (LICS) (2008)","DOI":"10.1109\/LICS.2008.46"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2006.01.018","volume":"358","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Characterizing ef and ex tree logics. Theoretical Computer Science\u00a0358, 255\u2013272 (2006)","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Forest algebras. In: Automata and Logic: History and Perspectives, pp. 107\u2013132. Amsterdam University Press (2007)"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2005.03.038","volume":"340","author":"Z. Esik","year":"2005","unstructured":"Esik, Z., Weil, P.: Algebraic characterization of regular tree languages. Theoretical Computer Science\u00a0340, 291\u2013321 (2005)","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R. McNaughton","year":"1974","unstructured":"McNaughton, R.: Algebraic decision procedures for local testability. Math. Syst. Theor.\u00a08, 60\u201376 (1974)","journal-title":"Math. Syst. Theor."},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-87531-4_29","volume-title":"Computer Science Logic","author":"T. Place","year":"2008","unstructured":"Place, T.: Characterization of logics over ranked tree languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 401\u2013415. Springer, Heidelberg (2008)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","volume":"36","author":"H. Straubing","year":"1985","unstructured":"Straubing, H.: Finite semigroup varieties of the form V*D. Journal of Pure and Applied Algebra\u00a036, 53\u201394 (1985)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0022-4049(87)90108-3","volume":"48","author":"B. Tilson","year":"1987","unstructured":"Tilson, B.: Categories as algebra: an essential ingredient in the theory of monoids. J. Pure Appl. Algebra\u00a048, 83\u2013198 (1987)","journal-title":"J. Pure Appl. Algebra"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-4049(85)90071-4","volume":"36","author":"D. Th\u00e9rien","year":"1985","unstructured":"Th\u00e9rien, D., Weiss, A.: Graph congruences and wreath products. J. Pure and Applied Algebra\u00a036, 205\u2013215 (1985)","journal-title":"J. Pure and Applied Algebra"},{"issue":"1","key":"24_CR16","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. Theoretical Computer Science\u00a0154(1), 85\u2013106 (1996)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:49:26Z","timestamp":1558403366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}