{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:57:33Z","timestamp":1648688253796},"reference-count":38,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":5645,"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":[[1998,2]]},"DOI":"10.1016\/s0304-3975(97)00145-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:42:52Z","timestamp":1027611772000},"page":"55-75","source":"Crossref","is-referenced-by-count":5,"title":["A polynomial algorithm testing partial confluence of basic semi-Thue systems"],"prefix":"10.1016","volume":"192","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00145-X_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB2","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","article-title":"An algebraic theory of graph reduction","volume":"40","author":"Arnborg","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01368784","article-title":"The equivalence of pre-NTS grammars is decidable","volume":"25","author":"Autebert","year":"1992","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB4","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":"Beei","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00145-X_BIB5","series-title":"Proc. 7th ICALP","first-page":"105","article-title":"Grammaires \u00e0 non-terminaux s\u00e9par\u00e9s","volume":"vol. 85","author":"Boasson","year":"1980"},{"issue":"3","key":"10.1016\/S0304-3975(97)00145-X_BIB6","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\/S0304-3975(97)00145-X_BIB7","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\/S0304-3975(97)00145-X_BIB8","series-title":"Texts and Monographs in Computer Science","article-title":"String Rewriting Systems","author":"Book","year":"1993"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB9","series-title":"Proc. 4th Workshop on Automated Deduction","first-page":"53","article-title":"Reduction systems and small cancellation theory","author":"B\u00fccken","year":"1979"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB10","series-title":"Actes des Premi\u00e8res Journ\u00e9es d'Informatique Th\u00e9orique","article-title":"Sur l'\u00e9quivalence des grammaires simples","author":"Butzbach","year":"1973"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB11","series-title":"Proc. 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\/S0304-3975(97)00145-X_BIB12","series-title":"Research Notes in Theoretical Computer Science","article-title":"Canonical Forms in Finitely Presented Algebras","author":"Le Chenadec","year":"1986"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB13","series-title":"Proc. 6th ICALP","first-page":"104","article-title":"Strict deterministic languages and controlled rewriting systems","volume":"vol. 71","author":"Chottin","year":"1979"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB14","article-title":"Sur l'alg\u00e9bricit\u00e9 des classes de certaines congruences d\u00e9finies sur le monoide libre","author":"Cochet","year":"1971","journal-title":"Th\u00e8se de l'universit\u00e9 de Rennes"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB15","first-page":"243","article-title":"Rewrite systems","volume":"vol. B","author":"Dershowitz","year":"1991"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB16","series-title":"Important Results and Trends in Theoretical Computer Science (Colloquium in Honor of Aarto Salomaa.)","first-page":"124","article-title":"Deciding the NTS-property of context-free grammars","volume":"vol. 812","author":"Engelfriet","year":"1994"},{"issue":"1","key":"10.1016\/S0304-3975(97)00145-X_BIB17","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0211013","article-title":"A polynomial algorithm for deciding the equivalence problem for 2-tape deterministic finite state acceptors","volume":"11","author":"Friedman","year":"1982","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(97)00145-X_BIB18","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/0304034","article-title":"Finite-turn pushdown automata","volume":"4","author":"Ginsburg","year":"1966","journal-title":"J. SIAM Control"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB19_1","article-title":"D\u00e9cidabilit\u00e9 de la confluence partielle d'un syst\u00e8me semi-Thu\u00e9ien rationnel","volume":"1","author":"Grosset-Grange","year":"1993","journal-title":"M\u00e9moire de DEA de l'universit\u00e9 de Bordeaux"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB19_2","first-page":"1","author":"Grosset-Grange","year":"1995","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB20","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","article-title":"The equivalence problem of multitape finite automata","volume":"78","author":"Harju","year":"1991","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(97)00145-X_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. ACM"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB22","series-title":"Proc. 18th ICALP","first-page":"279","article-title":"A specialized completion procedure for monadic string-rewriting systems presenting groups","volume":"vol. 510","author":"Madlener","year":"1991"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB23","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(93)90213-D","article-title":"On weakly confluent monadic string-rewriting systems","volume":"113","author":"Madiener","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00145-X_BIB24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02090778","article-title":"It is decidable whether a monadic Thue system is canonical over a regular set","volume":"23","author":"Narendran","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB25","series-title":"Proc. 2nd Ann. Symp. on Theory of Computing","article-title":"On some families of languages related to the Dyck language","author":"Nivat","year":"1970"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB26","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\/S0304-3975(97)00145-X_BIB27","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\/S0304-3975(97)00145-X_BIB28","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01213858","article-title":"The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems","volume":"25","author":"Otto","year":"1992","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB29","first-page":"1","article-title":"Syntaxe des languages 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\/S0304-3975(97)00145-X_BIB30","series-title":"Proc. 6th G.I. Symp. on Theoretical Computer Science","first-page":"313","article-title":"The equivalence problem for NTS languages is decidable","volume":"vol. 145","author":"S\u00e9nizergues","year":"1982"},{"issue":"3","key":"10.1016\/S0304-3975(97)00145-X_BIB31","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":"2","key":"10.1016\/S0304-3975(97)00145-X_BIB32","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\/S0304-3975(97)00145-X_BIB33","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(90)90048-M","article-title":"Some decision problems about controlled rewriting systems","volume":"71","author":"S\u00e9nizergues","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00145-X_BIB34","series-title":"Proc. RTA 95","first-page":"194","article-title":"A polynomial algorithm testing partial confluence of basic semi-Thue systems","author":"S\u00e9nizergues","year":"1995"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB35","series-title":"Proc. ICALP 97","first-page":"671","article-title":"The equivalence problem for deterministic pushdown automata is decidable","volume":"vol. 1256","author":"S\u00e9nizergues","year":"1997"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB36","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. Control"},{"key":"10.1016\/S0304-3975(97)00145-X_BIB37","first-page":"1","article-title":"Weak confluence is tractable for finite string-rewriting systems","author":"Zhang","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700145X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700145X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:58:29Z","timestamp":1556315909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759700145X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S030439759700145X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00145-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}