{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T04:39:58Z","timestamp":1715315998968},"reference-count":14,"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)90056-x","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"332-342","source":"Crossref","is-referenced-by-count":27,"title":["NTS languages are deterministic and congruential"],"prefix":"10.1016","volume":"31","author":[{"given":"L.","family":"Boasson","sequence":"first","affiliation":[]},{"given":"G.","family":"Senizergues","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(85)90056-X_BIB1","series-title":"The Theory of Parsing, Translation and Compiling","author":"Aho","year":"1972"},{"key":"10.1016\/0022-0000(85)90056-X_BIB2","first-page":"7","article-title":"Cylindres de Langages Alg\u00e9briques","author":"Autebert","year":"1978"},{"key":"10.1016\/0022-0000(85)90056-X_BIB3","series-title":"S\u00e9minaire d'Info. Th\u00e9orique","first-page":"123","article-title":"Congruences Plus que Parfaites et Langages Alg\u00e9briques","author":"Berstel","year":"1975"},{"key":"10.1016\/0022-0000(85)90056-X_BIB4","series-title":"7th Int. Colloq. Automata Lang. Program.","first-page":"109","article-title":"Grammaires \u00e0 Non-Terminaux S\u00e9par\u00e9s","volume":"Vol. 85","author":"Boasson","year":"1980"},{"key":"10.1016\/0022-0000(85)90056-X_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."},{"key":"10.1016\/0022-0000(85)90056-X_BIB6","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developping recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90056-X_BIB7","series-title":"1st Int. Colloq. Automata Lang. Program.","first-page":"3","article-title":"Une Famille de Congruences de Thue pour laquelle l'\u00c9quivalence est D\u00e9cidable","author":"Butzbach","year":"1973"},{"key":"10.1016\/0022-0000(85)90056-X_BIB8","doi-asserted-by":"crossref","first-page":"389","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\/0022-0000(85)90056-X_BIB9","first-page":"7","article-title":"Une Famille de Langages Alg\u00e9briques Congruenciels","author":"Frougny","year":"1980"},{"key":"10.1016\/0022-0000(85)90056-X_BIB10","series-title":"3rd. Colloq. Int. sur la Program.","article-title":"About a Transformation System: a Theoretical Study","author":"Kott","year":"1978"},{"key":"10.1016\/0022-0000(85)90056-X_BIB11","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/321406.321411","article-title":"Parenthesis grammars","volume":"14","author":"Mc Naughton","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90056-X_BIB12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/S0019-9958(80)90887-6","article-title":"The equivalence problem for real-time strict languages","volume":"45","author":"Oyamaguchi","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(85)90056-X_BIB13","first-page":"7","article-title":"D\u00e9cidabilit\u00e9 de l'\u00c9quivalence des Grammaires N.T.S.","author":"Senizergues","year":"1981"},{"key":"10.1016\/0022-0000(85)90056-X_BIB14","unstructured":"G. Senizergues, The equivalence and inclusion problem for N.T.S. languages, J. Comput. System Sci., in press."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008590056X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008590056X?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\/002200008590056X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["002200008590056X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90056-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}