{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:25Z","timestamp":1725664525057},"publisher-location":"Berlin, Heidelberg","reference-count":78,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593409"},{"type":"electronic","value":"9783540492375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59340-3_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:14:52Z","timestamp":1330276492000},"page":"75-94","source":"Crossref","is-referenced-by-count":6,"title":["Formal languages & word-rewriting"],"prefix":"10.1007","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01368784","volume":"25","author":"J.M. Autebert","year":"1992","unstructured":"J.M. Autebert and L. Boasson. The equivalence of pre-NTS grammars is decidable. Math. Systems Theory 25, pages 61\u201374, 1992.","journal-title":"Math. Systems Theory"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"J.M. Autebert, P. Flajolet, and J. Gabarro. Prefixes of infinite words and ambiguous context-free languages. IPL 25 (4), 1986.","DOI":"10.1016\/0020-0190(87)90162-1"},{"key":"7_CR3","unstructured":"J.M. Autebert. Langages alg\u00e9briques. Masson, 1987."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"J. Berstel and L. Boasson. Context-free languages. In Handbook of theoretical computer science, vol. B, Chapter 2, pages 59\u2013102. Elsevier, 1991.","DOI":"10.1016\/B978-0-444-88074-1.50007-X"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(76)90049-9","volume":"3","author":"C. Beeri","year":"1976","unstructured":"C. Beeri. An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata. TCS 3, pages 305\u2013320, 1976.","journal-title":"TCS"},{"key":"7_CR6","unstructured":"M. Benois. Parties rationnelles du groupe libre. C. R. Acad. Sci. s\u00e9rie A, pages 1188\u20131190, 1969."},{"key":"7_CR7","first-page":"121","volume":"256","author":"M. Benois","year":"1987","unstructured":"M. Benois. Descendants of regular language in a class of rewriting systems:algorithm and complexity of an automata construction. Proceedings RTA 87, LNCS 256, pages 121\u2013132, 1987.","journal-title":"Proceedings RTA 87, LNCS"},{"key":"7_CR8","unstructured":"J. Berstel. Congruences plus que parfaites et langages alg\u00e9briques. S\u00e9minaire d'informatique th\u00e9orique de Paris 6\u20137, 1976\u20131977."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(86)90034-7","volume":"22","author":"J. Berstel","year":"1986","unstructured":"J. Berstel. Every iterated morphism yields a co-cfl. IPL 22, pages 7\u20139, 1986.","journal-title":"IPL"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(82)90036-6","volume":"19","author":"R.V. Book","year":"1982","unstructured":"R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. TCS 19, pages 231\u2013251, 1982.","journal-title":"TCS"},{"key":"7_CR11","unstructured":"L. Boasson and M. Nivat. Centers of context-free languages. LITP technical report no 84-44, 1984."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(85)90122-X","volume":"20","author":"R.V. Book","year":"1985","unstructured":"R.V. Book and F. Otto. Cancellation rules and extended word problems. IPL 20, pages 5\u201311, 1985.","journal-title":"IPL"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"R.V. Book and F. Otto. String Rewriting Systems. Texts and monographs in Computer Science. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"7_CR14","unstructured":"L. Boasson. Grammaires \u00e0 non-terminaux s\u00e9par\u00e9s. In Proceedings 7th ICALP, pages 105\u2013118. LNCS 85, 1980."},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","volume":"3","author":"R.V. Book","year":"1987","unstructured":"R.V. Book. Thue systems as rewriting systems. J. Symbolic Computation. 3, pages 39\u201368, 1987.","journal-title":"J. Symbolic Computation"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(86)90087-6","volume":"23","author":"M. Benois","year":"1986","unstructured":"M. Benois and J. Sakarovitch. On the complexity of some extended word problems defined by cancellation rules. IPL 23, pages 281\u2013287, 1986.","journal-title":"IPL"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","volume":"6","author":"J.R. B\u00fcchi","year":"1964","unstructured":"J.R. B\u00fcchi. Regular canonical systems. Archiv fur Math. Logik und Grund-lagenforschung 6, pages 91\u2013111, 1964.","journal-title":"Archiv fur Math. Logik und Grund-lagenforschung"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"J.R. B\u00fcchi. Regular canonical systems, the collected works of J.R. Buchi, pages 317\u2013337, 1990.","DOI":"10.1007\/978-1-4613-8928-6_19"},{"key":"7_CR19","unstructured":"P. Butzbach. Sur l'\u00e9quivalence des grammaires simples. In Actes des Premi\u00e8res journ\u00e9es d'informatique Th\u00e9orique, Bonascre. ENSTA, 1973."},{"key":"7_CR20","unstructured":"P. Butzbach. Une famille de congruences de Thue pour lesquelles l'\u00e9quivalence est d\u00e9cidable. In Proceedings 1rst ICALP, pages 3\u201312. LNCS, 1973."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"A.C. Caron. Linear bounded automata and rewrite systems: influence of initial configurations on decision properties. In Proceedings CAAP 91, pages 74\u201389. LNCS, Springer-Verlag, 1991.","DOI":"10.1007\/3-540-53982-4_5"},{"key":"7_CR22","unstructured":"D. Caucal. Recritures suffixes de mots. Internal report IRISA nr 413, 1988."},{"key":"7_CR23","first-page":"66","volume":"401","author":"D. Caucal","year":"1989","unstructured":"D. Caucal. A fast algorithm to decide on simple grammars equivalence. L.N.C.S., Vol. 401, pages 66\u201385, 1989.","journal-title":"L.N.C.S."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"D. Caucal. A fast algorithm to decide on the equivalence of stateless dpda. RAIRO Theoret. Infor. and App., pages 23\u201348, 1993.","DOI":"10.1051\/ita\/1993270100231"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"L. Chottin. Strict deterministic languages and controlled rewriting systems. In Proceedings 6th ICALP. LNCS Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09510-1_9"},{"key":"7_CR26","first-page":"1","volume":"16","author":"L. Chottin","year":"1982","unstructured":"L. Chottin. Langages alg\u00e9briques et syst\u00e8mes de r\u00e9\u00e9criture rationnels. RAIRO Inform. T\u00e9or. 16, pages 1\u201320, 1982.","journal-title":"RAIRO Inform. T\u00e9or."},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Y. Cochet and M. Nivat. Une g\u00e9n\u00e9ralisation des ensembles de Dyck. Israel J. of Math. vol.9, n 3, 1971.","DOI":"10.1007\/BF02771689"},{"key":"7_CR28","unstructured":"Y. Cochet. Sur l'alg\u00e9bricit\u00e9 des classes de certaines congruences d\u00e9finies sur le monoide libre. Th\u00e8se de l'universit\u00e9 de Rennes, 1971."},{"key":"7_CR29","unstructured":"Y. Cochet. Congruences quasi-parfaites et langages rationnels. Manuscrit non-publi\u00e9, 1975."},{"key":"7_CR30","first-page":"1","volume":"no 16","author":"Y. Cochet","year":"1975\/76","unstructured":"Y. Cochet. Langages d\u00e9finis par des congruences. Groupe d'\u00e9tude d'Alg\u00e8bre, 1\u00e8re ann\u00e9e, no 16, pages 1\u20137, 1975\/76.","journal-title":"Groupe d'\u00e9tude d'Alg\u00e8bre, 1\u00e8re ann\u00e9e"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud. Rewrite systems. In Handbook of theoretical computer science, vol. B, Chapter 2, pages 243\u2013320. Elsevier, 1991.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"7_CR32","first-page":"311","volume":"27","author":"A. Ehrenfeucht","year":"1983","unstructured":"A. Ehrenfeucht, D. Haussler, and G. Rozenberg. On regularity of context-free languages. T.C.S. 27, pages 311\u2013322, 1983.","journal-title":"T.C.S."},{"key":"7_CR33","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","volume":"9","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg and S. Greibach. Deterministic context-free languages. Information and Control 9, pages 620\u2013648, 1966.","journal-title":"Information and Control"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"S. Greibach. A note on pushdown store automaton and regular systems. Proc. Amer. Math. Soc., pages 263\u2013268, 1967.","DOI":"10.1090\/S0002-9939-1967-0209086-1"},{"key":"7_CR35","unstructured":"M.A. Harrison. Introduction To Formal Language Theory. Addison-Wesley, 1978."},{"key":"7_CR36","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"issue":"no4","key":"7_CR37","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet. Confluent reductions:abstract properties and applications to term rewriting systems. JACM vol. 27 no 4, pages 797\u2013821, 1980.","journal-title":"JACM"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"M. Jantzen. Confluent String Rewriting (EATCS monograph). Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-61549-8"},{"key":"7_CR39","unstructured":"F. Kierszenbaum. Les langages \u00e0 op\u00e9rateurs d'insertion. These de Si\u00e8me cycle, universit\u00e9 Bordeaux I, 1979."},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"W. Kuich and A. Salomaa. Semirings, Automata, Languages (EATCS monograph). Springer-Verlag, 1986.","DOI":"10.1007\/978-3-642-69959-7"},{"key":"7_CR41","unstructured":"G. Lallement. The word problem for Thue systems. In Actes de l'\u00e9cole de printemps d'informatique th\u00e9orique, Font-Romeu 93. Springer-Verlag, 1994."},{"key":"7_CR42","unstructured":"Y. Lafont and A. Prout\u00e9. Church-Rosser property and homology of monoids. In Actes de l'\u00e9cole de printemps d'informatique th\u00e9orique, Font-Romeu 93. Springer-Verlag, 1994."},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Y. Matiyasevich. Word problem for Thue systems with a few relations. In Actes de l'\u00e9cole de printemps d'informatique th\u00e9orique, Font-Romeu 93. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-59340-3_4"},{"key":"7_CR44","unstructured":"R. McCloskey. Bounded context grammars and languages. PHD, 1993."},{"key":"7_CR45","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/321406.321411","volume":"14","author":"R. McNaughton","year":"1967","unstructured":"R. McNaughton. Parenthesis grammars. JACM 14, pages 490\u2013500, 1967.","journal-title":"JACM"},{"key":"7_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1215\/S0012-7094-44-01101-4","volume":"11","author":"M. Morse","year":"1944","unstructured":"M. Morse and G.A. Hedlung. Unending chess, symbolic dynamics and a problem in semi-groups. Duke Math. J. 11, pages 1\u20137, 1944.","journal-title":"Duke Math. J."},{"issue":"2","key":"7_CR47","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R. McNaughton","year":"1988","unstructured":"R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. JACM 35(2), pages 324\u2013344, 1988.","journal-title":"JACM"},{"key":"7_CR48","first-page":"119","volume":"113","author":"K. Madlener","year":"1993","unstructured":"K. Madlener, P. Narendran, F. Otto, and L. Zhang. On weakly confluent monadic string-rewriting systems. T.C.S. 113, pages 119\u2013165, 1993.","journal-title":"T.C.S."},{"key":"7_CR49","first-page":"143","volume":"67","author":"K. Madlener","year":"1989","unstructured":"K. Madlener and F. Otto. About the descriptive power of certain classes of finite string-rewriting systems. T.C.S. 67, pages 143\u2013172, 1989.","journal-title":"T.C.S."},{"key":"7_CR50","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(86)90121-0","volume":"44","author":"P. Narendran","year":"1986","unstructured":"P. Narendran. On the equivalence problem for regular Thue systems. TCS 44, pages 237\u2013245, 1986.","journal-title":"TCS"},{"key":"7_CR51","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02090778","volume":"23","author":"P. Narendran","year":"1990","unstructured":"P. Narendran. It is decidable whether a monadic Thue system is canonical over a regular set. Math. Systems Theory 23, pages 245\u2013254, 1990.","journal-title":"Math. Systems Theory"},{"key":"7_CR52","unstructured":"M. Nivat and M. Benois. Congruences parfaites et quasi-parfaites. S\u00e9minaire Dubreil, 2i\u00e8me ann\u00e9e, no 7, 1971\/72."},{"key":"7_CR53","doi-asserted-by":"crossref","unstructured":"M. Nivat. On some families of languages related to the Dyck language. 2nd Annual Symposium on Theory of Computing, 1970.","DOI":"10.1145\/800161.805168"},{"key":"7_CR54","first-page":"243","volume":"6","author":"M. Nivat","year":"1971","unstructured":"M. Nivat. Congruences de Thue et t-langages. Studia Scientiarum Mathematicarum Hungarica 6, pages 243\u2013249, 1971.","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"7_CR55","first-page":"343","volume":"30","author":"P. Narendran","year":"1986","unstructured":"P. Narendran, C. O'Dunlaing, and H. Rolletschek. Complexity of certain decision problems about congruential languages. JCSS 30, pages 343\u2013358, 1986.","journal-title":"JCSS"},{"key":"7_CR56","unstructured":"C. O'Dunlaing. Finite and infinite regular Thue systems. PHD University of California at Santa Barbara, 1981."},{"key":"7_CR57","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","volume":"2","author":"C. O'Dunlaing","year":"1983","unstructured":"C. O'Dunlaing. Infinite regular thue systems. TCS 2, pages 171\u2013192, 1983.","journal-title":"TCS"},{"issue":"nr3","key":"7_CR58","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/0022-0000(81)90072-6","volume":"23","author":"M. Oyamaguchi","year":"1981","unstructured":"M. Oyamaguchi, Y. Inagaki, and N. Honda. The equivalence problem for two dpda's one of which is a finite-turn or one-counter machine. J. Comput. System Sci.23, nr 3, pages 366\u2013382, 1981.","journal-title":"J. Comput. System Sci."},{"key":"7_CR59","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(84)90090-2","volume":"33","author":"F. Otto","year":"1984","unstructured":"F. Otto. Some undecidability results for non-monadic Church-Rosser Thue systems. TCS 33, pages 261\u2013278, 1984.","journal-title":"TCS"},{"key":"7_CR60","first-page":"285","volume":"35","author":"F. Otto","year":"1987","unstructured":"F. Otto. On deciding the confluence of a finite string-rewriting system on a given congruence class. JCSS 35, pages 285\u2013310, 1987.","journal-title":"JCSS"},{"key":"7_CR61","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01614148","volume":"2","author":"F. Otto","year":"1992","unstructured":"F. Otto. Completing a finite special string-rewriting system on the congruence class of the empty word. Applicable Algebra in Engeneering Comm. Comput. 2, pages 257\u2013274, 1992.","journal-title":"Applicable Algebra in Engeneering Comm. Comput."},{"key":"7_CR62","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01213858","volume":"25","author":"F. Otto","year":"1992","unstructured":"F. Otto. The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems. Math. Systems Theory 25, pages 241\u2013251, 1992.","journal-title":"Math. Systems Theory"},{"key":"7_CR63","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF01178585","volume":"28","author":"F. Otto","year":"1991","unstructured":"F. Otto and L. Zhang. Decision problems for finite special string-rewriting systems that are confluent on some congruence class. Acta Informatica 28, pages 477\u2013510, 1991.","journal-title":"Acta Informatica"},{"key":"7_CR64","doi-asserted-by":"crossref","unstructured":"F. Romian and J. Sakarovitch. One-sided Dyck reduction over two letters and deterministic context-free languages. In Proceedings MFCS 86, pages 554\u2013563. Springer-Verlag, LNCS 233, 1986.","DOI":"10.1007\/BFb0016282"},{"key":"7_CR65","unstructured":"J. Sakarovitch. Syntaxe des langages de Chomsky, essai sur le d\u00e9terminisme. Th\u00e8se de doctorat d'\u00e9tat de l'universit\u00e9 Paris VII, pages 1\u2013175, 1979."},{"key":"7_CR66","unstructured":"A. Salomaa. Formal Languages. Academic Press, 1973."},{"key":"7_CR67","unstructured":"G. S\u00e9nizergues. D\u00e9cidabilit\u00e9 de l'\u00e9quivalence des grammaires NTS. Th\u00e8se de 3i\u00e8me cycle, universit\u00e9 Paris 7, pages 1\u2013170, 1981."},{"issue":"3","key":"7_CR68","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-0000(85)90055-8","volume":"31","author":"G. S\u00e9nizergues","year":"1985","unstructured":"G. S\u00e9nizergues. The equivalence and inclusion problems for NTS languages. J. Comput. System Sci. 31 (3), pages 303\u2013331, 1985.","journal-title":"J. Comput. System Sci."},{"key":"7_CR69","unstructured":"G. S\u00e9nizergues. On the rational subsets of the free group. LITP internal report nr 86-3, submitted to Acta Informatica, pages 1\u201317, 1986."},{"key":"7_CR70","first-page":"1","volume":"88-39","author":"G. S\u00e9nizergues","year":"1987","unstructured":"G. S\u00e9nizergues. Sur la description des langages alg\u00e9briques d\u00e9terministes par des syst\u00e8mes de r\u00e9\u00e9criture confluents. Th\u00e8se d'\u00e9tat, universit\u00e9 Paris 7 et rapport LITP 88-39, pages 1\u2013330, 1987.","journal-title":"Th\u00e8se d'\u00e9tat, universit\u00e9 Paris 7 et rapport LITP"},{"issue":"3","key":"7_CR71","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0890-5401(89)90032-1","volume":"81","author":"G. S\u00e9nizergues","year":"1989","unstructured":"G. S\u00e9nizergues. Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages. Information and Computation 81 (3), pages 265\u2013279, 1989.","journal-title":"Information and Computation"},{"issue":"2","key":"7_CR72","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0304-3975(90)90123-Y","volume":"70","author":"G. S\u00e9nizergues","year":"1990","unstructured":"G. S\u00e9nizergues. A characterisation of deterministic context-free languages by means of right-congruences. TCS 70 (2), pages 213\u2013232, 1990.","journal-title":"TCS"},{"key":"7_CR73","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. TCS 71, pages 281\u2013346, 1990.","journal-title":"TCS"},{"key":"7_CR74","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(75)90058-3","volume":"27","author":"M. Takahashi","year":"1975","unstructured":"M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control 27, pages 1\u201335, 1975.","journal-title":"Information and Control"},{"key":"7_CR75","first-page":"1","volume":"nr 8","author":"A. Thue","year":"1912","unstructured":"A. Thue. Uber die gegenseitiges lage gleicher teile gewisser zeichenreihen. Skr. Vid. Kristiania, I Mat. Naturv. Klasse nr 8, pages 1\u201367, 1912.","journal-title":"Skr. Vid. Kristiania, I Mat. Naturv. Klasse"},{"key":"7_CR76","first-page":"34","volume":"nr 10","author":"A. Thue","year":"1914","unstructured":"A. Thue. Probleme \u00fcber ver\u00e4nderungen von zeichenreihen nach gegeben regeln. Skr. Vid. Kristiania, I Mat. Naturv. Klasse nr 10, page 34 pp, 1914.","journal-title":"Skr. Vid. Kristiania, I Mat. Naturv. Klasse"},{"key":"7_CR77","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","volume":"25","author":"L.G. Valiant","year":"1974","unstructured":"L.G. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Information and Control 25, pages 123\u2013133, 1974.","journal-title":"Information and Control"},{"key":"7_CR78","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(92)90082-7","volume":"44","author":"L. Zhang","year":"1992","unstructured":"L. Zhang. The pre-NTS property is undecidable for context-free grammars. IPL 44, pages 181\u2013184, 1992.","journal-title":"IPL"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59340-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:26:58Z","timestamp":1605648418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59340-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593409","9783540492375"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/3-540-59340-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}