{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:03Z","timestamp":1725487623722},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695066"},{"type":"electronic","value":"9783540695073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_44","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:35:58Z","timestamp":1184592958000},"page":"510-521","source":"Crossref","is-referenced-by-count":2,"title":["Restarting Tree Automata"],"prefix":"10.1007","author":[{"given":"Heiko","family":"Stamer","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_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. J.\u00a0Comput.\u00a0Syst.\u00a0Sci.\u00a013, 223\u2013244 (1976)","journal-title":"J.\u00a0Comput.\u00a0Syst.\u00a0Sci."},{"key":"44_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Release October (2002)"},{"key":"44_CR3","first-page":"79","volume":"41","author":"A. Dikorsky","year":"2000","unstructured":"Dikorsky, A., Modina, L.: Dependencies on the Other Side of the Curtain. Traitement Automatique des Langues (TAL)\u00a041, 79\u2013111 (2000)","journal-title":"Traitement Automatique des Langues (TAL)"},{"key":"44_CR4","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, 3rd edn., pp. 1\u201368. Springer, Heidelberg (1997)","edition":"3"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown Tree Automata. Math.\u00a0Syst.\u00a0Theory\u00a016, 237\u2013263 (1983)","journal-title":"Math.\u00a0Syst.\u00a0Theory"},{"key":"44_CR6","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":"44_CR7","first-page":"287","volume":"4","author":"P. Jan\u010dar","year":"1999","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: On Monotonic Automata with a\u00a0Restart Operation. J.\u00a0Autom.\u00a0Lang.\u00a0Comb.\u00a04, 287\u2013312 (1999)","journal-title":"J.\u00a0Autom.\u00a0Lang.\u00a0Comb."},{"key":"44_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-642-59126-6_5","volume-title":"Handbook of Formal Languages","author":"M. Jantzen","year":"1997","unstructured":"Jantzen, M.: Basics of Term Rewriting. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, 3rd edn., pp. 269\u2013337. Springer, Heidelberg (1997)","edition":"3"},{"key":"44_CR9","first-page":"407","volume":"9","author":"T. Jurdzi\u0144ski","year":"2004","unstructured":"Jurdzi\u0144ski, T., Lory\u015b, K., Niemann, G., Otto, F.: Some Results on RWW- and RRWW-Automata and Their Relationship to the Class of Growing Context-Sensitive Languages. J.\u00a0Autom.\u00a0Lang.\u00a0Comb.\u00a09, 407\u2013437 (2004)","journal-title":"J.\u00a0Autom.\u00a0Lang.\u00a0Comb."},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/11549345_46","volume-title":"Mathematical Foundations of Computer Science 2005","author":"T. Jurdzi\u0144ski","year":"2005","unstructured":"Jurdzi\u0144ski, T., Otto, F.: Shrinking Restarting Automata. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 532\u2013543. Springer, Heidelberg (2005)"},{"key":"44_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/11551874_18","volume-title":"Text, Speech and Dialogue","author":"M. Lopatkov\u00e1","year":"2005","unstructured":"Lopatkov\u00e1, M., Pl\u00e1tek, M., Kubo\u0148, V.: Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction. In: Matou\u0161ek, V., Mautner, P., Pavelka, T. (eds.) TSD 2005. LNCS (LNAI), vol.\u00a03658, pp. 140\u2013147. Springer, Heidelberg (2005)"},{"key":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11753728_26","volume-title":"Computer Science \u2013 Theory and Applications","author":"H. Messerschmidt","year":"2006","unstructured":"Messerschmidt, H., Otto, F.: On Nonforgetting Restarting Automata that Are Deterministic and\/or Monotone. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 247\u2013258. Springer, Heidelberg (2006)"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1142\/9789812704979_0027","volume-title":"Proc. Words, Languages and Combinatorics III","author":"G. Niemann","year":"2003","unstructured":"Niemann, G., Otto, F.: Further Results on Restarting Automata. In: Ito, M., Imaoka, T. (eds.) Proc. Words, Languages and Combinatorics III, pp. 352\u2013369. World Sci., Singapore (2003)"},{"key":"44_CR14","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)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:29:37Z","timestamp":1550435377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}