{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:38Z","timestamp":1725664598465},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629504"},{"type":"electronic","value":"9783540690511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62950-5_63","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:58:35Z","timestamp":1330297115000},"page":"83-97","source":"Crossref","is-referenced-by-count":1,"title":["On the property of preserving regularity for string-rewriting systems"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1007\/BF01071030","volume":"7","author":"A.V. Anissimov","year":"1971","unstructured":"A.V. Anissimov. Group languages. Cybernetics, 7:594\u2013601, 1971.","journal-title":"Cybernetics"},{"key":"7_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W.J. Brainerd","year":"1969","unstructured":"W.J. Brainerd. Tree generating regular systems. Information and Control, 14:217\u2013231, 1969.","journal-title":"Information and Control"},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)90101-5","volume":"127","author":"J.-L. Coquid\u00e9","year":"1994","unstructured":"J.-L. Coquid\u00e9, M. Dauchet, R. Gilleron, and S. V\u00e1gv\u00f6lgyi. Bottom-up tree pushdown automata: classification and connection with rewrite systems. Theoretical Computer Science, 127:69\u201398, 1994.","journal-title":"Theoretical Computer Science"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In C. Choffrut and M. Jantzen, editors, Proc. of STACS'91, Lecture Notes in Computer Science 480, pages 148\u2013159. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0020795"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1090\/S0002-9939-1967-0209086-1","volume":"18","author":"S. Greibach","year":"1967","unstructured":"S. Greibach. A note on pushdown store automata and regular systems. Proc. American Mathematical Society, 18:263\u2013268, 1967.","journal-title":"Proc. American Mathematical Society"},{"key":"7_CR7","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":"7_CR8","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. Fundamenta Informaticae, 24:157\u2013175, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"P. Gyenizse and S. V\u00e1gv\u00f6lgyi. Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Theoretical Computer Science, 1997. to appear.","DOI":"10.1016\/S0304-3975(96)00333-7"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.2307\/2269811","volume":"31","author":"P.K. Hooper","year":"1966","unstructured":"P.K. Hooper. The undecidability of the Turing machine immortality problem. J. Symbolic Logic, 31:219\u2013234, 1966.","journal-title":"J. Symbolic Logic"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/inco.1993.1003","volume":"102","author":"A.J. Kfoury","year":"1993","unstructured":"A.J. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semiunification problem. Information and Computation, 102:83\u2013101, 1993.","journal-title":"Information and Computation"},{"key":"7_CR12","volume-title":"Combinatorial Group Theory","author":"R.C. Lyndon","year":"1977","unstructured":"R.C. Lyndon and P.E. Schupp. Combinatorial Group Theory. Springer-Verlag, Berlin, 1977."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science 256","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-17220-3_12","volume-title":"Rewriting Techniques and Applications","author":"K. Madlener","year":"1987","unstructured":"K. Madlener and F. Otto. Groups presented by certain classes of finite length-reducing string-rewriting systems. In P. Lescanne, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 256, pages 133\u2013144. Springer-Verlag, Berlin, 1987."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(08)80150-2","volume":"12","author":"F. Otto","year":"1991","unstructured":"F. Otto. When is an extension of a specification consistent? Decidable and undecidable cases. Journal of Symbolic Computation, 12:255\u2013273, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR15","unstructured":"F. Otto. Preserving regularity and related properties of string-rewriting systems. Mathematische Schriften Kassel 6\/96, Universit\u00e4t-GH Kassel, September 1996."},{"key":"7_CR16","unstructured":"J. Sakarovitch. Syntaxe des langages de Chomsky, essai sur le d\u00e9terminisme, 1979. Th\u00e8se de doctorat d'\u00e9tat de l'universit\u00e9 Paris VII."},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"K. Salomaa. Deterministic tree pushdown automata and monadic tree rewriting systems. Journal of Computer and System Sciences, 37:367\u2013394, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(90)90048-M","volume":"71","author":"G. S\u00e9nizergues","year":"1990","unstructured":"G. S\u00e9nizergues. Some decision problems about controlled rewriting systems. Theoretical Computer Science, 71:281\u2013346, 1990.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62950-5_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:41:04Z","timestamp":1619574064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62950-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629504","9783540690511"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-62950-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}