{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:01:44Z","timestamp":1767913304091,"version":"3.49.0"},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":8812,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0890-5401(89)90032-1","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"265-279","source":"Crossref","is-referenced-by-count":7,"title":["Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages"],"prefix":"10.1016","volume":"81","author":[{"given":"G.","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90032-1_bib1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(84)90040-9","article-title":"Remarques sur les langages de parentheses","volume":"31","author":"Autebert","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90032-1_bib2","article-title":"Langages de parentheses, langages N.T.S. et morphismes inverses","volume":"18","author":"Autebert","year":"1984","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0890-5401(89)90032-1_bib3","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonet. Sprachwissensch. Kommun."},{"key":"10.1016\/0890-5401(89)90032-1_bib4","first-page":"522","article-title":"Finite complete rewriting systems and the complexity of the word problem","author":"Bauer","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(89)90032-1_bib5","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 pushdown automata","volume":"3","author":"Beeri","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90032-1_bib6","first-page":"1188","article-title":"Parties rationelles du groupe libre","volume":"269","author":"Benois","year":"1969","journal-title":"C.R. Acad. Sci. Paris S\u00e9r. A"},{"key":"10.1016\/0890-5401(89)90032-1_bib7","series-title":"Proceedings, ICALP","first-page":"109","article-title":"D\u00e9rivations et r\u00e9ductions dans les grammaires alg\u00e9briques","volume":"Vol. 85","author":"Boasson","year":"1980"},{"key":"10.1016\/0890-5401(89)90032-1_bib8","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0022-0000(85)90056-X","article-title":"N.T.S. languages are congruential and deterministic","volume":"31","author":"Boasson","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(89)90032-1_bib9","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\/0890-5401(89)90032-1_bib10","first-page":"223","article-title":"Sur l'\u00e9quivalence des grammaires simples","author":"Butzbach","year":"1978"},{"key":"10.1016\/0890-5401(89)90032-1_bib11","series-title":"Proceedings, ICALP","article-title":"Strict deterministic languages and controlled rewriting systems","volume":"Vol. 71","author":"Chottin","year":"1979"},{"issue":"No. 2","key":"10.1016\/0890-5401(89)90032-1_bib12","doi-asserted-by":"crossref","DOI":"10.1051\/ita\/1982160200931","article-title":"Langages alg\u00e9briques et syst\u00e8mes de r\u00e9\u00e9criture rationnels","volume":"16","author":"Chottin","year":"1982","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0890-5401(89)90032-1_bib13","series-title":"Groupe d'\u00e9tude d'alg\u00e8bre","article-title":"Langages d\u00e9finis par des congruences","author":"Cochet","year":"1975"},{"key":"10.1016\/0890-5401(89)90032-1_bib14","article-title":"Une famille de langages congruentiels: les langages\u00e0non-terminaux s\u00e9par\u00e9s","author":"Frougny","year":"1980","journal-title":"Th\u00e8se de 3\u00e8mede Maths"},{"key":"10.1016\/0890-5401(89)90032-1_bib15","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","article-title":"Deterministic context-free languages","volume":"9","author":"Ginsburg","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(89)90032-1_bib16","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\/0890-5401(89)90032-1_bib17","series-title":"2nd Symposium on Theory of Computing","first-page":"221","article-title":"On some families of languages related to the Dyck language","author":"Nivat","year":"1970"},{"key":"10.1016\/0890-5401(89)90032-1_bib18","series-title":"S\u00e9minaire Dubreil, 25\u00e8meann\u00e9e","article-title":"Congruences parfaites et quasi-parfaites","author":"Nivat","year":"1971"},{"key":"10.1016\/0890-5401(89)90032-1_bib19","first-page":"339","article-title":"Infinite regular Thue systems","volume":"23","author":"O'Dunlaing","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90032-1_bib20","unstructured":"Oyamaguchi, M.(1986), personnal communication."},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90032-1_bib21","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1145\/28869.28881","article-title":"The equivalence problem for real-time dpda's","volume":"34","author":"Oyamaguchi","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90032-1_bib22","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(81)90072-6","article-title":"The equivalence problem for two dpda's one of which is a finite-turn or one-counter machine","volume":"23","author":"Oyamaguchi","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(89)90032-1_bib23","series-title":"Proceedings IFIP Congress 80","first-page":"53","article-title":"On the equivalence problem for two dpda's one of which is real-time","author":"Oyamaguchi","year":"1980"},{"key":"10.1016\/0890-5401(89)90032-1_bib24","article-title":"Syntaxe des langages de Chomsky Essai sur le d\u00e9terminisme","author":"Sakarovitch","year":"1979","journal-title":"Th\u00e8se d'\u00e9tat de Maths"},{"key":"10.1016\/0890-5401(89)90032-1_bib25","article-title":"D\u00e9cidabilit\u00e9de l'\u00e9quivalence des grammaires N.T.S.","author":"S\u00e9nizergues","year":"1981","journal-title":"Th\u00e8se de 3\u00e8mecycle de Maths"},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90032-1_bib26","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."},{"key":"10.1016\/0890-5401(89)90032-1_CE0010","doi-asserted-by":"crossref","unstructured":"S\u00e9nizergues, G.(in press 1), A characterisation of deterministic context-free languages by means of right-congruences,Theoret. Comput. Sci.","DOI":"10.1016\/0304-3975(90)90123-Y"},{"key":"10.1016\/0890-5401(89)90032-1_CE0015","doi-asserted-by":"crossref","unstructured":"S\u00e9nizergues, G.(in press 2), Some decision problems about controlled rewriting systems,Theoret. Comput. Sci.","DOI":"10.1016\/0304-3975(90)90048-M"},{"key":"10.1016\/0890-5401(89)90032-1_bib28","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"},{"key":"10.1016\/0890-5401(89)90032-1_bib29","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"},{"key":"10.1016\/0890-5401(89)90032-1_bib30","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/S0022-0000(75)80005-5","article-title":"Deterministic one-counter automata","volume":"10","author":"Valiant","year":"1975","journal-title":"J. Comput. System Sci."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:27:07Z","timestamp":1549027627000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0890540189900321"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90032-1","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}