{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:10Z","timestamp":1759638970225},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8508,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0304-3975(90)90048-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"281-346","source":"Crossref","is-referenced-by-count":19,"title":["Some decision problems about controlled rewriting systems"],"prefix":"10.1016","volume":"71","author":[{"given":"G.","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90048-M_BIB1","series-title":"The Theory of Parsing, Translation and Compiling","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(90)90048-M_BIB2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(76)90049-9","article-title":"An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata","volume":"3","author":"Beeri","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90048-M_BIB3","doi-asserted-by":"crossref","unstructured":"M. Benois and J. Sakarovitch, On the complexity of some extended word problems defined by cancellation rules, Inform. Process. Lett., to appear.","DOI":"10.1016\/0020-0190(86)90087-6"},{"key":"10.1016\/0304-3975(90)90048-M_BIB4","article-title":"Congruences plus que parfaites et langages alg\u00e9briques","author":"Berstel","year":"1976","journal-title":"S\u00e9minaire d'informatique th\u00e9orique de Paris 6"},{"key":"10.1016\/0304-3975(90)90048-M_BIB5","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(90)90048-M_BIB6","series-title":"7th ICALP","first-page":"105","article-title":"Grammaires \u00e0 non-terminaux s\u00e9par\u00e9s","volume":"85","author":"Boasson","year":"1980"},{"key":"10.1016\/0304-3975(90)90048-M_BIB7","article-title":"Centers of context-free languages","author":"Boasson","year":"1984","journal-title":"LITP technical report no. 84-44"},{"key":"10.1016\/0304-3975(90)90048-M_BIB8","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0022-0000(85)90056-X","article-title":"NTS languages are deterministic and congruential","volume":"31","author":"Boasson","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90048-M_BIB9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","article-title":"Thue systems as rewriting systems","volume":"3","author":"Book","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(90)90048-M_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(82)90036-6","article-title":"Monadic Thue systems","volume":"19","author":"Book","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90048-M_BIB11","series-title":"1st ICALP","first-page":"3","article-title":"Une famille de congruences de Thue pour lesquelles l'\u00e9quivalence est d\u00e9cidable","author":"Butzbach","year":"1973"},{"key":"10.1016\/0304-3975(90)90048-M_BIB12","series-title":"Actes des Premi\u00e9res Journ\u00e9es d'Informatique Th\u00e9orique","article-title":"Sur l'\u00e9quivalence des grammaires simples","author":"Butzbach","year":"1973"},{"issue":"no. 413","key":"10.1016\/0304-3975(90)90048-M_BIB13","article-title":"Recritures suffixes de mots","author":"Caucal","year":"1988","journal-title":"Publication interne de l'IRISA"},{"key":"10.1016\/0304-3975(90)90048-M_BIB14","series-title":"Proc. 6th ICALP","article-title":"Strict deterministic languages and controlled rewriting systems","author":"Chottin","year":"1979"},{"key":"10.1016\/0304-3975(90)90048-M_BIB15","first-page":"1","article-title":"Langages alg\u00e9briques et syst\u00e9mes de r\u00e9\u00e9criture rationnels RAIRO","volume":"16","author":"Chottin","year":"1982","journal-title":"Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(90)90048-M_BIB16","article-title":"Sur l'alg\u00e9bricit\u00e9 des classes de certaines congruences d\u00e9finies sur le mono\u00efde libre","author":"Cochet","year":"1971","journal-title":"Tech. Report Universit\u00e9 de Rennes"},{"key":"10.1016\/0304-3975(90)90048-M_BIB17","author":"Cochet","year":"1975","journal-title":"Congruences quasi-parfaites et langages rationnels"},{"key":"10.1016\/0304-3975(90)90048-M_BIB18","doi-asserted-by":"crossref","DOI":"10.1007\/BF02771689","article-title":"Une g\u00e9n\u00e9ralisation des ensembles de Dyck","volume":"9","author":"Cochet","year":"1971","journal-title":"Israel J. Math"},{"key":"10.1016\/0304-3975(90)90048-M_BIB19","series-title":"Automata, Languages and Machines","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0304-3975(90)90048-M_BIB20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1090\/S0002-9939-1967-0209086-1","article-title":"A note on pushdown store automata and regular systems","volume":"18","author":"Greibach","year":"1967","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(90)90048-M_BIB21","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90048-M_BIB22","series-title":"Thue congruences and complete string rewriting systems","author":"Jantzen","year":"1985"},{"key":"10.1016\/0304-3975(90)90048-M_BIB23","series-title":"Th\u00e8se de 3 cycle","article-title":"Les langages \u00e0 op\u00e9rateurs d'insertion","author":"Kierszenbaum","year":"1979"},{"key":"10.1016\/0304-3975(90)90048-M_BIB24","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(86)90121-0","article-title":"On the equivalence problem for regular Thue systems","volume":"44","author":"Narendran","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90048-M_BIB25","series-title":"2nd Annual Symp. on Comp. of computing","article-title":"On some families of languages related to the Dyck language","author":"Nivat","year":"1970"},{"key":"10.1016\/0304-3975(90)90048-M_BIB26","first-page":"1","article-title":"Congruences parfaites et quasi-parfaites","volume":"25","author":"Nivat","year":"1972","journal-title":"S\u00e9m. Dubreil (Alg\u00e8bre)"},{"key":"10.1016\/0304-3975(90)90048-M_BIB27","series-title":"Ph.D. Dissertation","article-title":"Finite and infinite regular Thue systems","author":"O'Dunlaing","year":"1981"},{"key":"10.1016\/0304-3975(90)90048-M_BIB28","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","article-title":"Infinite regular Thue systems","volume":"2","author":"O'Dunlaing","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90048-M_BIB29","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(84)90090-2","article-title":"Some undecidability results for non-monadic Church-Rosser Thue systems","volume":"33","author":"Otto","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90048-M_BIB30","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(87)90017-1","article-title":"On deciding the confluence of a finite string-rewriting system on a given congruence class","volume":"35","author":"Otto","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90048-M_BIB31","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1145\/28869.28881","article-title":"The equivalence problem for real-time d.p.d.a.'s","volume":"34","author":"Oyamaguchi","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90048-M_BIB32","article-title":"Syntaxe des langages de Chomsky, essai sur le d\u00e9terminisme","author":"Sakarovitch","year":"1979","journal-title":"Th\u00e8se de doctorat d'\u00e9tat de l'universit\u00e9 Paris VII"},{"key":"10.1016\/0304-3975(90)90048-M_BIB33","series-title":"Th\u00e8se de 3i\u00e8me Cycle","article-title":"D\u00e9cidabilit\u00e9 de l'\u00e9quivalence des grammaires NTS","author":"S\u00e9nizergues","year":"1981"},{"key":"10.1016\/0304-3975(90)90048-M_BIB34","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-0000(85)90055-8","article-title":"The equivalence and inclusion problems for NTS languages","volume":"31","author":"S\u00e9nizergues","year":"1985","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0304-3975(90)90048-M_BIB35","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0890-5401(89)90032-1","article-title":"Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages","volume":"81","author":"S\u00e9nizergues","year":"1989","journal-title":"Inform. and Comput."},{"issue":"2","key":"10.1016\/0304-3975(90)90048-M_BIB36","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0304-3975(90)90123-Y","article-title":"A characterisation of deterministic context-free languages by means of right-congruences","volume":"70","author":"S\u00e9nizergues","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90048-M_BIB37","article-title":"Sur la description des langages alg\u00e9briques d\u00e9terministes par des syst\u00e8mes de r\u00e9\u00e9criture confluents","author":"S\u00e9nizergues","year":"1987","journal-title":"Th\u00e9se d'Etat, Universit\u00e9 Paris 7"},{"key":"10.1016\/0304-3975(90)90048-M_BIB38","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","article-title":"The equivalence problem for deterministic finite-turn pushdown automata","volume":"25","author":"Valiant","year":"1974","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090048M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090048M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:57:09Z","timestamp":1555127829000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090048M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["030439759090048M"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90048-m","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}