{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:06Z","timestamp":1725497166793},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75414-5_18","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T06:22:54Z","timestamp":1196922174000},"page":"275-289","source":"Crossref","is-referenced-by-count":1,"title":["Restarting Tree Automata and Linear Context-Free Tree Languages"],"prefix":"10.1007","author":[{"given":"Heiko","family":"Stamer","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0022-0000(76)80032-3","volume":"13","author":"A. Arnold","year":"1976","unstructured":"Arnold, A., Dauchet, M.: Un th\u00e9or\u00e8me de duplication pour les for\u00eats alg\u00e9briques. Journal of Computer and System Sciences\u00a013, 223\u2013244 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A.V. Aho","year":"1968","unstructured":"Aho, A.V.: Indexed grammars\u2014An extension of context-free grammars. Journal of the ACM\u00a015, 647\u2013671 (1968)","journal-title":"Journal of the ACM"},{"key":"18_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"18_CR4","first-page":"131","volume-title":"IEEE Conf.\u00a0Record, 9th Ann.\u00a0Symp.\u00a0on Switching and Automata Theory","author":"M.J. Fischer","year":"1968","unstructured":"Fischer, M.J.: Grammars with macro-like productions. In: IEEE Conf.\u00a0Record, 9th Ann.\u00a0Symp.\u00a0on Switching and Automata Theory, pp. 131\u2013142. IEEE Computer Society Press, Los Alamitos (1968)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Fujiyoshi, A.: Restrictions on monadic context-free tree grammars. In: COLING 2004, Proc., pp. 78\u201384 (2004)","DOI":"10.3115\/1220355.1220367"},{"key":"18_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"},{"key":"18_CR7","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":"18_CR8","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":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-62844-4_8","volume-title":"New Trends in Formal Languages","author":"P. Jan\u010dar","year":"1997","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: On restarting automata with rewriting. In: P\u0103un, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol.\u00a01218, pp. 119\u2013136. Springer, Heidelberg (1997)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2005.11.024","volume":"354","author":"S. Kepser","year":"2006","unstructured":"Kepser, S., M\u00f6nnich, U.: Closure properties of linear context-free tree languages with an application to optimality theory. Theoretical Computer Science\u00a0354, 82\u201397 (2006)","journal-title":"Theoretical Computer Science"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0022-0000(74)80031-0","volume":"8","author":"T.S.E. Maibaum","year":"1974","unstructured":"Maibaum, T.S.E.: A generalized approach to formal languages. Journal of Computer and System Sciences\u00a08, 409\u2013439 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0022-0000(78)90012-0","volume":"17","author":"T.S.E. Maibaum","year":"1978","unstructured":"Maibaum, T.S.E.: Pumping lemmas for term languages. Journal of Computer and System Sciences\u00a017, 319\u2013330 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-45007-6_5","volume-title":"Developments in Language Theory","author":"F. Otto","year":"2003","unstructured":"Otto, F.: Restarting automata and their relations to the Chomsky hierarchy. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 55\u201374. Springer, Heidelberg (2003)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/800161.805156","volume-title":"Second Annual ACM Symp. on Theory of Computing, Proc.","author":"W.C. Rounds","year":"1970","unstructured":"Rounds, W.C.: Tree-oriented proofs of some theorems on context-free and indexed languages. In: Second Annual ACM Symp. on Theory of Computing, Proc., pp. 109\u2013116. ACM Press, New York (1970)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0022-0000(85)90002-9","volume":"30","author":"K.M. Schimpf","year":"1985","unstructured":"Schimpf, K.M., Gallier, J.H.: Tree pushdown automata. Journal of Computer and System Sciences\u00a030, 25\u201340 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR16","unstructured":"Seki, H., Kato, Y.: On the generative power of multiple context-free grammars and macro grammars. Information Science Technical Report, NAIST-IS-TR2006007, Nara Institute of Science and Technology (2006)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-540-69507-3_44","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"H. Stamer","year":"2007","unstructured":"Stamer, H., Otto, F.: Restarting tree automata. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 510\u2013521. Springer, Heidelberg (2007)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. Vijay-Shankar","year":"1994","unstructured":"Vijay-Shankar, 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"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75414-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:04Z","timestamp":1619506864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75414-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754138"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75414-5_18","relation":{},"subject":[]}}