{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:43Z","timestamp":1725536323908},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03564-7_22","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T07:05:35Z","timestamp":1250751935000},"page":"324-341","source":"Crossref","is-referenced-by-count":0,"title":["Single-Path Restarting Tree Automata"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]},{"given":"Heiko","family":"Stamer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (September 2005)"},{"key":"22_CR2","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":"22_CR3","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, vol.\u00a03, pp. 1\u201368. Springer, Heidelberg (1997)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-60249-6_60","volume-title":"Fundamentals of Computation Theory","author":"P. Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 283\u2013292. Springer, Heidelberg (1995)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1009918602528","volume":"2","author":"F. Mr\u00e1z","year":"1999","unstructured":"Mr\u00e1z, F., Pl\u00e1tek, M., Proch\u00e1zka, M.: On special forms of restarting automata. Grammars\u00a02, 223\u2013233 (1999)","journal-title":"Grammars"},{"key":"22_CR6","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-33461-3_11","volume-title":"Recent Advances in Formal Languages and Applications","author":"F. Otto","year":"2006","unstructured":"Otto, F.: Restarting automata. In: \u00c9sik, Z., Mart\u00edn-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol.\u00a025, pp. 269\u2013303. Springer, Heidelberg (2006)"},{"key":"22_CR7","first-page":"115","volume-title":"DLT 1999, Proc.","author":"M. Pl\u00e1tek","year":"2000","unstructured":"Pl\u00e1tek, M.: Weak cyclic forms of restarting automata. In: Rozenberg, G., Thomas, W. (eds.) DLT 1999, Proc., pp. 115\u2013124. World Scientific, Singapore (2000)"},{"key":"22_CR8","unstructured":"Stamer, H.: Restarting Tree Automata \u2013 Formal Properties and Possible Variations. Doctoral Dissertation, Fachbereich Elektrotechnik\/Informatik, Universit\u00e4t Kassel (2008)"},{"key":"22_CR9","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":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-75414-5_18","volume-title":"Algebraic Informatics","author":"H. Stamer","year":"2007","unstructured":"Stamer, H., Otto, F.: Restarting tree automata and linear context-free tree languages. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol.\u00a04728, pp. 275\u2013289. Springer, Heidelberg (2007)"},{"key":"22_CR11","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T13:25:04Z","timestamp":1552137904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}