{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:59:51Z","timestamp":1743015591030,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637004"},{"type":"electronic","value":"9783540696315"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052167","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T04:43:12Z","timestamp":1149655392000},"page":"366-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Strict LT2 : Regular :: Local : Recognizable"],"prefix":"10.1007","author":[{"given":"James","family":"Rogers","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,16]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Patrick Blackburn, Claire Gardent, and Wilfried Meyer-Viol. Talking about trees. In EACL 93, pages 21\u201329. EACL, 1993.","DOI":"10.3115\/976744.976748"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Patrick Blackburn and Wilfried Meyer-Viol. Modal logic and model-theoretic syntax. In Martin de Rijke, editor, Advances in Intensional Logic, pages 27\u201358. Kluwer, 1996.","DOI":"10.1007\/978-94-015-8879-9_2"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. R. B\u00fcchi","year":"1960","unstructured":"J. R. B\u00fcchi. Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik, 6:66\u201392, 1960.","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"20_CR4","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"N. Chomsky and M. P. Sch\u00fczenberger. The algebraic theory of context-free languages. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, Studies in Logic and the Foundations of Mathematics, pages 118\u2013161. North-Holland, Amsterdam, 2nd (1967) edition, 1963.","edition":"2nd (1967) edit"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"John Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406\u2013451, 1970.","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2307\/1993511","volume":"98","author":"C. C. Elgot","year":"1961","unstructured":"Calvin C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society, 98:21\u201351, 1961.","journal-title":"Transactions of the American Mathematical Society"},{"key":"20_CR7","unstructured":"Kit Fine. A new characterization of context-free languages. Manuscript, Sept. 1991."},{"key":"20_CR8","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"Ferenc G\u00e9cseg and Magnus Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f6, Budapest, 1984."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Saul Gorn. Explicit definitions and linguistic dominoes. In John F. Hart and Satoru Takasu, editors, Systems and Computer Science, Proceedings of the Conference held at Univ. of Western Ontario, 1965. Univ. of Toronto Press, 1967.","DOI":"10.3138\/9781487592769-008"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01048404","volume":"4","author":"M. Kracht","year":"1995","unstructured":"Marcus Kracht. Syntactic codes and grammar refinement. Journal of Logic, Language, and Information, 4:41\u201360, 1995.","journal-title":"Journal of Logic, Language, and Information"},{"key":"20_CR11","volume-title":"Number 65 in Research Monograph","author":"R. McNaughton","year":"1971","unstructured":"Robert McNaughton and Seymour Papert. Counter-Free Automata. Number 65 in Research Monograph. MIT Press, Cambridge, MA, 1971."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"J. Mezei and J. B. Wright. Algebraic automata and context-free sets. Information and Control, 11:3\u201329, 1967.","journal-title":"Information and Control"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1\u201335, July 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J. W. Thatcher","year":"1967","unstructured":"J. W. Thatcher. Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences, 1:317\u2013322, 1967.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T20:11:26Z","timestamp":1675714286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0052167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637004","9783540696315"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0052167","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"16 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}