{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:55Z","timestamp":1725490555745},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424918"},{"type":"electronic","value":"9783540446743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44674-5_4","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T09:49:49Z","timestamp":1188294589000},"page":"57-66","source":"Crossref","is-referenced-by-count":0,"title":["Regularly Extended Two-Way Nondeterministic Tree Automata"],"prefix":"10.1007","author":[{"given":"Anne","family":"Br\u00fcggemann-Klein","sequence":"first","affiliation":[]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0031-3203(91)90112-I","volume":"24","author":"A. Barrero","year":"1991","unstructured":"A. Barrero. Unranked tree languages. Pattern Recognition, 24(1):9\u201318, 1991.","journal-title":"Pattern Recognition"},{"key":"4_CR2","unstructured":"T. Bray, J.P. Paoli, and C.M. Sperberg-McQueen. Extensible markup language (XML) 1.0. http:\/\/www.w3.org\/TR\/1998\/REC-xml-19980210\/ , February 1998."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"A. Br\u00fcggemann-Klein and D. Wood. Caterpillars: A context specification technique, 2000. To appear in Markup Languages.","DOI":"10.1162\/109966200750410613"},{"key":"4_CR4","unstructured":"H. Comon, M. Daucher, R. Gilleron, S. Tison, and M. Tommasi. Tree automata techniques and applications, 1998. Available on the Web from l3ux02.univ-lille3.fr in directory tata."},{"key":"4_CR5","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"4_CR6","first-page":"1","volume-title":"Handbook of Formal Languages, Volume 3, Beyond Words","author":"F. G\u00e9cseg","year":"1997","unstructured":"F. G\u00e9cseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3, Beyond Words, pages 1\u201368. Springer-Verlag, Berlin, Heidelberg, New York, 1997."},{"key":"4_CR7","unstructured":"ISO 8879: Information processing\u2014Text and office systems\u2014Standard Generalized Markup Language (SGML), October 1986. International Organization for Standardization."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(94)00022-0","volume":"50","author":"E. Moriya","year":"1994","unstructured":"E. Moriya. On two-way tree automata. Information Processing Letters, 50:117\u2013121, 1994.","journal-title":"Information Processing Letters"},{"key":"4_CR9","unstructured":"M. Murata. Forest-regular languages and tree-regular languages. Unpublished manuscript, 1995."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(96)00048-8","volume":"58","author":"K. Salomaa","year":"1996","unstructured":"K. Salomaa. Yield-languages of two-way pushdown tree automata. Information Processing Letters, 58:195\u2013199, 1996.","journal-title":"Information Processing Letters"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(75)90058-3","volume":"27","author":"M. Takahashi","year":"1975","unstructured":"M. Takahashi. Generalization of regular sets and their application to a study of context-free languages. Information and Control, 27(1):1\u201336, January 1975.","journal-title":"Information and Control"},{"key":"4_CR12","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"},{"key":"4_CR13","unstructured":"J.W. Thatcher. A further generalization of finite automata. Technical Report RC 1846, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1967."},{"key":"4_CR14","unstructured":"J.W. Thatcher. There\u2019s a lot more to finite automata theory than you would have thought. Technical Report RC 2852 (#13407), IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1970."},{"key":"4_CR15","first-page":"820","volume":"12","author":"J.W. Thatcher","year":"1965","unstructured":"J.W. Thatcher and J.B. Wright. Abstract 65T-469. Notices of the American Mathematical Society, 12:820, 1965.","journal-title":"Notices of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44674-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:06:03Z","timestamp":1556802363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}