{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:26:17Z","timestamp":1767911177514,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":10090,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1016\/0022-0000(85)90055-8","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"303-331","source":"Crossref","is-referenced-by-count":27,"title":["The equivalence and inclusion problems for NTS languages"],"prefix":"10.1016","volume":"31","author":[{"given":"G.","family":"Senizergues","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(85)90055-8_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\/0022-0000(85)90055-8_BIB2","series-title":"S\u00e9minaire d'Informatique Th\u00e9orique\u2014L.I.T.P.","first-page":"123","article-title":"Congruences plus que parfaites et langages alg\u00e9briques","author":"Berstel","year":"1975"},{"key":"10.1016\/0022-0000(85)90055-8_BIB3","series-title":"Int. Colloq. Automata. Lang. and Programming","first-page":"109","article-title":"Grammaires a Non-terminaux s\u00e9par\u00e9s","volume":"Vol. 85","author":"Boasson","year":"1980"},{"issue":"No. 1","key":"10.1016\/0022-0000(85)90055-8_BIB4","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\/0022-0000(85)90055-8_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(81)90036-3","article-title":"N.T.S. grammars and Church-Rosser systems","volume":"13","author":"Book","year":"1981","journal-title":"Inform. Process. Lett."},{"issue":"No. 1","key":"10.1016\/0022-0000(85)90055-8_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","article-title":"Confluent and other types of Thue systems","volume":"29","author":"Book","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90055-8_BIB7","series-title":"1st Int. Colloq. Automata. Lang. and Programming","first-page":"3","article-title":"Une famille de congruences de Thue pour laquelle l'\u00e9quivalence est d\u00e9cidable","author":"Butzbach","year":"1973"},{"key":"10.1016\/0022-0000(85)90055-8_BIB8","article-title":"Sur l'alg\u00e9bricit\u00e9 des classes de certaines congruences d\u00e9finies sur le monoide libre","author":"Cochet","year":"1971"},{"key":"10.1016\/0022-0000(85)90055-8_BIB9","series-title":"Automata, Languages and Machines","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0022-0000(85)90055-8_BIB10","article-title":"Une famille de langages alg\u00e9briques congruentiels: les langages \u00e0 Non-terminaux s\u00e9par\u00e9s","author":"Frougny","year":"1980","journal-title":"Th\u00e8se de 3\u00e8me cycle"},{"key":"10.1016\/0022-0000(85)90055-8_BIB11","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/321406.321411","article-title":"Parenthesis grammars","volume":"14","author":"McNaughton","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90055-8_BIB12","series-title":"S\u00e9minaire Dubreil","article-title":"Congruences parfaites et quasi-parfaites","author":"Nivat","year":"1971"},{"key":"10.1016\/0022-0000(85)90055-8_BIB13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02771689","article-title":"Une g\u00e9n\u00e9ralisation des ensembles de Dyck","volume":"9","author":"Nivat","year":"1971","journal-title":"Israel J. Math."},{"key":"10.1016\/0022-0000(85)90055-8_BIB14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","article-title":"Infinite regular Thue system","volume":"25","author":"O'Dunlaing","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(85)90055-8_BIB15","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/S0019-9958(80)90887-6","article-title":"The equivalence problem for real-time strict deterministic languages","volume":"45","author":"Oyamaguchi","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(85)90055-8_BIB16","article-title":"D\u00e9cidabilit\u00e9 de l'\u00e9quivalence des grammaires N.T.S.","author":"Senizergues","year":"1981","journal-title":"Th\u00e8se de 3\u00e8me cycle"},{"key":"10.1016\/0022-0000(85)90055-8_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(75)90058-3","article-title":"Generalizations of regular sets and their application to a study of context-free languages","volume":"27","author":"Takahashi","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(85)90055-8_BIB18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(83)90106-8","article-title":"Nest-sets and relativised closure properties","volume":"22","author":"Takahashi","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(85)90055-8_BIB19","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\/0022-0000(85)90055-8_BIB20","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":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900558?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900558?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:54:07Z","timestamp":1550332447000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000085900558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["0022000085900558"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90055-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}