{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:02Z","timestamp":1725489362236},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_10","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"107-121","source":"Crossref","is-referenced-by-count":6,"title":["Bottom-Up Rewriting Is Inverse Recognizability Preserving"],"prefix":"10.1007","author":[{"given":"Ir\u00e8ne","family":"Durand","sequence":"first","affiliation":[]},{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-17220-3_11","volume-title":"Rewriting Techniques and Applications","author":"M. Benois","year":"1987","unstructured":"Benois, M.: Descendants of regular language in a class of rewriting systems: algorithm and complexity of an automata construction. In: Lescanne, P. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a0256, pp. 121\u2013132. Springer, Heidelberg (1987)"},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(86)90087-6","volume":"23","author":"M. Benois","year":"1986","unstructured":"Benois, M., Sakarovitch, J.: On the complexity of some extended word problems defined by cancellation rules. Inform. Process. Lett.\u00a023(6), 281\u2013287 (1986)","journal-title":"Inform. Process. Lett."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Book, R.V., Jantzen, M., Wrathall, C.: Monadic Thue systems. TCS 19, pp. 231\u2013251 (1982)","DOI":"10.1016\/0304-3975(82)90036-6"},{"key":"10_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), Draft available from http:\/\/www.grappa.univ"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jsco.1994.1039","volume":"18","author":"R. Cremanns","year":"1994","unstructured":"Cremanns, R., Otto, F.: Finite derivation type implies the homological finiteness condition FP3. J. Symbolic Comput.\u00a018(2), 91\u2013112 (1994)","journal-title":"J. Symbolic Comput."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0890-5401(90)90015-A","volume":"88","author":"M. Dauchet","year":"1990","unstructured":"Dauchet, M., Heuillard, T., Lescanne, P., Tison, S.: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Inf. Comput.\u00a088(2), 187\u2013201 (1990)","journal-title":"Inf. Comput."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/LICS.1990.113750","volume-title":"Fifth Annual IEEE Symposium on Logic in Computer Science","author":"M. Dauchet","year":"1990","unstructured":"Dauchet, M., Tison, S.: The theory of ground rewrite systems is decidable. In: Fifth Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, pp. 242\u2013248. IEEE Comput. Soc. Press, Los Alamitos, CA (1990)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/3-540-50939-9_135","volume-title":"TAPSOFT \u201989","author":"A. Deruyver","year":"1989","unstructured":"Deruyver, A., Gilleron, R.: The reachability problem for ground TRS and some extensions. In: D\u00edaz, J., Orejas, F. (eds.) TAPSOFT 1989. LNCS, vol.\u00a0351, pp. 227\u2013243. Springer, Heidelberg (1989)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ic.2004.10.003","volume":"196","author":"I. Durand","year":"2005","unstructured":"Durand, I., Middeldorp, A.: Decidable call-by-need computations in term rewriting. Information and Computation\u00a0196, 95\u2013126 (2005)","journal-title":"Information and Computation"},{"key":"10_CR10","unstructured":"Durand, I., S\u00e9nizergues, G.: Bottom-up rewriting for words and terms (2007), Manuscript available at http:\/\/dept-info.labri.u-bordeaux.fr\/~ges"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/BFb0055774","volume-title":"Mathematical Foundations of Computer Science 1998","author":"Z. F\u00fcl\u00f6p","year":"1998","unstructured":"F\u00fcl\u00f6p, Z., Jurvanen, E., Steinby, M., V\u00e1gv\u00f6lgyi, S.: On one-pass term rewriting. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 248\u2013256. Springer, Heidelberg (1998)"},{"issue":"3-4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. Journal Applicable Algebra in Engineering, Communication and Computing\u00a015(3-4), 149\u2013171 (2004)","journal-title":"Journal Applicable Algebra in Engineering, Communication and Computing"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Term Rewriting and Applications","author":"A. Geser","year":"2005","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, Springer, Heidelberg (2005)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Proceedings of the 7th International Conference on Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) Proceedings of the 7th International Conference on Rewriting Techniques and Applications. LNCS, vol.\u00a01103, pp. 362\u2013376. Springer, Heidelberg (1996)"},{"issue":"3","key":"10_CR15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.3233\/FI-1999-39305","volume":"39","author":"T. Knapik","year":"1999","unstructured":"Knapik, T., Calbrix, H.: Thue specifications and their monadic second-order properties. Fund. Inform.\u00a039(3), 305\u2013325 (1999)","journal-title":"Fund. Inform."},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1017\/S096012950000133X","volume":"1","author":"Y. Lafont","year":"1991","unstructured":"Lafont, Y., Prout\u00e9, A.: Church-Rosser property and homology of monoids. Math. Structures Comput. Sci.\u00a01(3), 297\u2013326 (1991)","journal-title":"Math. Structures Comput. Sci."},{"key":"10_CR17","unstructured":"Lohrey, M., S\u00e9nizergues, G.: Rational subsets of HNN-extensions (2005), Manuscript available at http:\/\/dept-info.labri.u-bordeaux.fr\/~ges"},{"key":"10_CR18","unstructured":"Silva, P.V., Kambites, M., Steinberg, B.: On the rational subset problem for groups. J. of Algebra (to appear)"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1006\/inco.2002.3157","volume":"178","author":"T. Nagaya","year":"2002","unstructured":"Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. Information and Computation\u00a0178(2), 499\u2013514 (2002)","journal-title":"Information and Computation"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1016\/j.jsc.2004.12.008","volume":"40","author":"P. R\u00e9ty","year":"2005","unstructured":"R\u00e9ty, P., Vuotto, J.: Tree automata for rewrite strategies. J. Symb. Comput.\u00a040(1), 749\u2013794 (2005)","journal-title":"J. Symb. Comput."},{"key":"10_CR21","unstructured":"Sakarovitch, J.: Syntaxe des langages de Chomsky, essai sur le d\u00e9terminisme. Th\u00e8se de doctorat d\u2019\u00e9tat de l\u2019universit\u00e9 Paris VII, pp. 1\u2013175 (1979)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45610-4_8","volume-title":"Rewriting Techniques and Applications","author":"H. Seki","year":"2002","unstructured":"Seki, H., Takai, T., Fujinaka, Y., Kaji, Y.: Layered transducing term rewriting system and its recognizability preserving property. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, Springer, Heidelberg (2002)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-59340-3_7","volume-title":"Term rewriting (Font Romeu, 1993)","author":"G. S\u00e9nizergues","year":"1995","unstructured":"S\u00e9nizergues, G.: Formal languages & word-rewriting. In: Comon, H., Jouannaud, J.-P. (eds.) Term rewriting (Font Romeu, 1993). LNCS, vol.\u00a0909, pp. 75\u201394. Springer, Heidelberg (1995)"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Seynhaeve, F., Tison, S., Tommasi, M.: Homomorphisms and concurrent term rewriting. In: FCT, pp. 475\u2013487 (1999)","DOI":"10.1007\/3-540-48321-7_40"},{"key":"10_CR25","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite-path overlapping term rewriting systems effectively preserve recognizability. Scienticae Mathematicae Japonicae (to appear, preliminary version: IEICE Technical Report COMP98-45) (2006)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:14:48Z","timestamp":1605762888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}