{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:45:33Z","timestamp":1768286733110,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540565031","type":"print"},{"value":"9783540475743","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_60","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:16:53Z","timestamp":1330255013000},"page":"607-616","source":"Crossref","is-referenced-by-count":19,"title":["Locally threshold testable languages of infinite words"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Wilke","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"60_CR1","volume-title":"North-Holland Mathematical Library, vol. 6","author":"C. Berge","year":"1985","unstructured":"Claude Berge, Graphs, second revised ed., North-Holland Mathematical Library, vol. 6, North-Holland, Amsterdam, 1985, part 1.","edition":"second revised"},{"key":"60_CR2","first-page":"63","volume-title":"Lecture Notes in Computer Science, vol. 372","author":"D. Beauquier","year":"1989","unstructured":"Daniele Beauquier and Jean Eric Pin, Factors of words, Automata, Languages and Programming: 16th Intern. Coll., Stresa, 1989, Proc. (G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, eds.), Lecture Notes in Computer Science, vol. 372, Springer, 1989, pp 63\u201379."},{"key":"60_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"Janus A. A. Brzozowski","year":"1973","unstructured":"Janus A. Brzozowski and Imre Simon, Characterization of locally testable events, Discrete Math. 4 (1973), 243\u2013271.","journal-title":"Discrete Math."},{"key":"60_CR4","unstructured":"J. Richard B\u00fcchi, On a decision method in restricted second-order arithmetic, Logic, Methodology, and Philosophy of Science: Proc of the 1960 International Congress (E. Nagel, P. Suppes, and A. Tarski, eds.), Stanford University Press, 1962, pp 1\u201311."},{"key":"60_CR5","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"Laurence H. H. Landweber","year":"1969","unstructured":"Laurence H. Landweber, Decision problems for \u03c9-automata, Math. Systems Theory 3 (1969), 376\u2013384.","journal-title":"Math. Systems Theory"},{"key":"60_CR6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R. McNaughton","year":"1974","unstructured":"Robert McNaughton, Algebraic decision procedures for local testability, Math. Systems Theory 8 (1974), 60\u201376.","journal-title":"Math. Systems Theory"},{"key":"60_CR7","first-page":"379","volume":"10","author":"L. Staiger","year":"1974","unstructured":"Ludwig Staiger and Klaus Wagner, Automatentheoretische Charakterisierungen topologischer Klassen regul\u00e4rer Folgenmengen, Elektron. Informationsverarb. Kybernet. 10 (1974), 379\u2013392.","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"60_CR8","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Wolfgang Thomas, Classifying regular events in symbolic logic, J. Comput. System Sci. 25 (1982), 360\u2013376.","journal-title":"J. Comput. System Sci."},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas, Automata on infinite objects, Handbook of Theoretical Computer Science (Jan van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990, pp 134\u2013191.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"60_CR10","volume-title":"Technical report 9202","author":"T. Wilke","year":"1992","unstructured":"Thomas Wilke, An algebraic theory for regular languages of finite and infinite words, Technical report 9202, Inst f. Inform. u. Prakt. Math., Univ. Kiel, Germany, 1992. To appear in Intern. J. Algebra Comput."}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:04:30Z","timestamp":1605647070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}