{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:21Z","timestamp":1725488961863},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_8","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"67-77","source":"Crossref","is-referenced-by-count":4,"title":["Transition Graphs of Rewriting Systems over Unranked Trees"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[]},{"given":"Alex","family":"Spelten","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Blumensath, A.: Automatic Structures. Diploma thesis, RWTH Aachen, Germany (1999), \n                    \n                      http:\/\/www-mgi.informatik.rwth-aachen.de\/Publications\/pub\/blume\/AutStr.ps.gz"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W. Brainerd","year":"1969","unstructured":"Brainerd, W.: Tree generating regular systems. Inf. and Contr.\u00a014(2), 217\u2013231 (1969)","journal-title":"Inf. and Contr."},{"key":"8_CR3","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Unfinished technical report, Hongkong University (April 2001), \n                    \n                      http:\/\/citeseer.ist.psu.edu\/451005.html"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-540-25979-4_8","volume-title":"Rewriting Techniques and Applications","author":"J. Carme","year":"2004","unstructured":"Carme, J., Nieren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 105\u2013118. Springer, Heidelberg (2004)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. TCS\u00a0106(1), 61\u201386 (1992)","journal-title":"TCS"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On infinite terms having a decidable theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"key":"8_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (Unpublished electronic book, 1997), \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)90101-5","volume":"127","author":"J.-L. Coquid\u00e9","year":"1994","unstructured":"Coquid\u00e9, J.-L., Dauchet, M., Gilleron, R., V\u00e1gv\u00f6lgyi, S.: Bottom-up tree pushdown automata: classification and connection with rewrite systems. TCS\u00a0127(1), 69\u201398 (1994)","journal-title":"TCS"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(78)90039-7","volume":"7","author":"B. Courcelle","year":"1978","unstructured":"Courcelle, B.: A representation of trees by languages. TCS\u00a07, 25\u201355 (1978)","journal-title":"TCS"},{"key":"8_CR10","first-page":"242","volume-title":"Proc. LICS 1990","author":"M. Dauchet","year":"1990","unstructured":"Dauchet, M., Tison, S.: The theory of ground rewrite systems is decidable. In: Proc. LICS 1990, pp. 242\u2013248. IEEE CSP, Los Alamitos (1990)"},{"key":"8_CR11","first-page":"995","volume-title":"Handbook of TCS","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of TCS, pp. 995\u20131072. Elsevier, Amsterdam (1990)"},{"key":"8_CR12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"2001","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Boston (2001)","edition":"2"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/3-540-45841-7_46","volume-title":"STACS 2002","author":"C. L\u00f6ding","year":"2002","unstructured":"L\u00f6ding, C.: Ground tree rewriting graphs of bounded tree width. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 559\u2013570. Springer, Heidelberg (2002)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45931-6_20","volume-title":"Foundations of Software Science and Computation Structures","author":"C. L\u00f6ding","year":"2002","unstructured":"L\u00f6ding, C.: Model-checking infinite systems generated by ground tree rewriting. In: Nielsen, M., Engberg, U. (eds.) ETAPS 2002 and FOSSACS 2002. LNCS, vol.\u00a02303, pp. 280\u2013294. Springer, Heidelberg (2002)"},{"key":"8_CR15","unstructured":"L\u00f6ding, C.: Infinite Graphs Generated by Tree Rewriting. PhD thesis, RWTH Aachen, Germany (2003)"},{"key":"8_CR16","unstructured":"Seese, D.: Entscheidbarkeits- und Definierbarkeitsfragen der Theorie, netzartiger Graphen-I. Wiss. Zeitschrift HU Berlin, XXI(5), 513\u2013517 (1972)"},{"key":"8_CR17","unstructured":"Spelten, A.: Rewriting Systems over Unranked Trees. Diploma thesis, RWTH Aachen, Germany (2006), \n                    \n                      http:\/\/www-i7.informatik.rwth-aachen.de\/download\/papers\/spelten\/sp06.pdf"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(75)90058-3","volume":"27","author":"M. Takahashi","year":"1975","unstructured":"Takahashi, M.: Generalizations of regular sets and their application to a study of context-free languages. Inf. and Contr.\u00a027(1), 1\u201336 (1975)","journal-title":"Inf. and Contr."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-46011-X_10","volume-title":"Developments in Language Theory","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: A short introduction to infinite automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 130\u2013144. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:42Z","timestamp":1619519382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}