{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:37Z","timestamp":1725468517826},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055774","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"248-256","source":"Crossref","is-referenced-by-count":3,"title":["On one-pass term rewriting"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"F\u00fcl\u00f6p","sequence":"first","affiliation":[]},{"given":"Eija","family":"Jurvanen","sequence":"additional","affiliation":[]},{"given":"Magnus","family":"Steinby","sequence":"additional","affiliation":[]},{"given":"S\u00e1ndor","family":"V\u00e1gv\u00f6lgyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"J. Avenhaus. Reduktionssysteme. Springer, 1995.","DOI":"10.1007\/978-3-642-79351-6"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"M. Dauchet and F. De Comite. A gap between linear and non-linear term-rewriting systems. In RTA-87, LNCS 256. Springer, 1987, 95\u2013104.","DOI":"10.1007\/3-540-17220-3_9"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, volume B of Handbook of Theoretical Computer Science, chapter 6, pages 243\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"A. Deruyver and R. Gilleron. The reachability problem for ground TRS and some extensions. In TAPSOFT'89, LNCS 351. Springer, 1989, 227\u2013243.","DOI":"10.1007\/3-540-50939-9_135"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"J. Engelfriet and E. M. Schmidt. IO and OI. Part I. J. Comput. Syst. Sci., 15(3):328\u2013353, 1977. Part II. J. Comput. Syst. Sci., 16(1):67\u201399, 1978.","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR6","volume-title":"Tree automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Languages, volume 3 of Handbook of Formal Languages, chapter 1, pages 1\u201368. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In STACS'91, LNCS 480. Springer, 1991, 148\u2013159.","DOI":"10.1007\/BFb0020795"},{"issue":"12","key":"21_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundam. Inf., 24(1,2):157\u2013175, 1995.","journal-title":"Fundam. Inf."},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":":91","DOI":"10.1006\/jsco.1994.1005","volume":"17","author":"D. Hofbauer","year":"1994","unstructured":"D. Hofbauer and M. Huber. Linearizing term rewriting systems using test sets. J. Symb. Comput., 17(1):91\u2013129, 1994.","journal-title":"J. Symb. Comput."},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1995.1054","volume":"118","author":"G. Kucherov","year":"1995","unstructured":"G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. Inf. Comput., 118(1):91\u2013100, 1995.","journal-title":"Inf. Comput."},{"key":"21_CR12","first-page":"197","volume":"48","author":"S. V\u00e1gv\u00f6lgyi","year":"1992","unstructured":"S. V\u00e1gv\u00f6lgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible, ground terms is recognizable. Bull. EATCS, 48:197\u2013209, 1992.","journal-title":"Bull. EATCS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T19:03:42Z","timestamp":1587150222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0055774","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}