{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:21Z","timestamp":1725545061168},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_11","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"129-140","source":"Crossref","is-referenced-by-count":3,"title":["Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton"],"prefix":"10.1007","author":[{"given":"Akio","family":"Fujiyoshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ikuo","family":"Kawaharada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) release (October 1, 2002) available on: \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-59126-6_1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Languages. In: Handbook of Formal Languages, vol.\u00a03, pp. 1\u201368. Springer, Berlin (1997)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown tree automata. Mathematical Systems Theory\u00a016, 237\u2013263 (1983)","journal-title":"Mathematical Systems Theory"},{"key":"11_CR4","first-page":"1727","volume":"J68-D","author":"S. Tanaka","year":"1985","unstructured":"Tanaka, S., Kasai, T.: The emptiness problem for indexed languages is exponential time complete. IEICE Trans (published in Japanese)\u00a0J68-D, 1727\u20131734 (1985)","journal-title":"IEICE Trans. (published in Japanese)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s002249910004","volume":"33","author":"A. Fujiyoshi","year":"2000","unstructured":"Fujiyoshi, A., Kasai, T.: Spinal-formed context-free tree grammars. Theory of Computing Systems\u00a033, 59\u201383 (2000)","journal-title":"Theory of Computing Systems"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.ipl.2004.10.008","volume":"93","author":"A. Fujiyoshi","year":"2005","unstructured":"Fujiyoshi, A.: Linearity and nondeletion on monadic context-free tree grammars. Information Processing Letters\u00a093, 103\u2013107 (2005)","journal-title":"Information Processing Letters"},{"volume-title":"Tree adjoining grammars: formalisms, linguistic analysis and processing","year":"2000","key":"11_CR7","unstructured":"Abeill\u00e9, A., Rambow, O. (eds.): Tree adjoining grammars: formalisms, linguistic analysis and processing. CSLI Publications, Stanford, California (2000)"},{"key":"11_CR8","unstructured":"Fujiyoshi, A.: Epsilon-free grammars and lexicalized grammars that generate the class of the mildly context-sensitive languages. In: Proceedings of 7th International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+7), Vancouver, pp. 16\u201323 (2004)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A.K. Joshi","year":"1975","unstructured":"Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct grammars. J. Computer & System Sciences\u00a010, 136\u2013163 (1975)","journal-title":"J. Computer & System Sciences"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of Formal Languages","author":"A.K. Joshi","year":"1997","unstructured":"Joshi, A.K., Schabes, Y.: Tree-adjoining grammars. In: Handbook of Formal Languages, vol.\u00a03, pp. 69\u2013124. Springer, Berlin (1997)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/S009753979326009X","volume":"25","author":"S. Rajasekaran","year":"1996","unstructured":"Rajasekaran, S.: Tree-adjoining language parsing in O(n\n                           6) time. SIAM J. Comput.\u00a025, 862\u2013873 (1996)","journal-title":"SIAM J. Comput."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/jcss.1997.1537","volume":"56","author":"S. Rajasekaran","year":"1998","unstructured":"Rajasekaran, S., Yooseph, S.: TAL recognition in O(M(n\n                           2)) time. J. Computer & System Sciences\u00a056, 83\u201389 (1998)","journal-title":"J. Computer & System Sciences"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory\u00a027, 511\u2013546 (1994)","journal-title":"Mathematical Systems Theory"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"Rounds, W.C.: Mapping and grammars on trees. Mathematical Systems Theory\u00a04, 257\u2013287 (1970)","journal-title":"Mathematical Systems Theory"},{"key":"11_CR15","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:12Z","timestamp":1619507112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11605157_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}