{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:50:35Z","timestamp":1648648235371},"reference-count":7,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1984]]},"DOI":"10.1051\/ita\/1984180403271","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:38:39Z","timestamp":1486395519000},"page":"327-344","source":"Crossref","is-referenced-by-count":5,"title":["Langages de parenth\u00e8ses, langages N.T.S. et homomorphismes inverses"],"prefix":"10.1051","volume":"18","author":[{"given":"J.-M.","family":"Autebert","sequence":"first","affiliation":[]},{"given":"L.","family":"Boasson","sequence":"additional","affiliation":[]},{"given":"G.","family":"S\u00e9nizergues","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. AUTEBERT J.-M., BEANQUIER J., BOASSON L. et S\u00e9nizergues G. Remarques sur les langages de parenth\u00e8ses. Theoretical Computer Science, vol. 31, 1984, p. 337-349.7521090549.68072","DOI":"10.1016\/0304-3975(84)90040-9"},{"key":"R2","unstructured":"2. BOASSON L., Grammaires \u00e0 non-terminaux s\u00e9par\u00e9s, 7e ICALP, Lecture Notes in Computer Science, vol. 85, 1980, p. 105-118."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BOOK R. V., N.T.S. Grammars and Church-Rosser Systems, Information Processing Letters, vol. 13, 1981, p. 73-76.6458140476.68053","DOI":"10.1016\/0020-0190(81)90036-3"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. MCNAUGHTON R., Parenthesis grammars, Journal of the Association for Computing Machinery, vol. 14, 1967, p. 490-500.2347810168.01206","DOI":"10.1145\/321406.321411"},{"key":"R5","unstructured":"5. S\u00c9NIZERGUES G., D\u00e9cidabilit\u00e9 de l'\u00e9quivalence des grammaires N.T.S, Th\u00e8se de 3e cycle de l'Universit\u00e9 Paris 7, 1981."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. TAKAHASHI M., Generalisations of regular sets and their applicationto a study of context-free languages, Information and Control, vol. 27, 1975, p. 1-36.3733870291.68031","DOI":"10.1016\/S0019-9958(75)90058-3"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. TAKAHASHI M., Nets-sets and relativized closure properties, Theoretical Computer Science, vol. 22, 1983, p. 253-264.6930590497.68045","DOI":"10.1016\/0304-3975(83)90106-8"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180403271\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:34:48Z","timestamp":1568799288000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180403271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":7,"journal-issue":{"issue":"4"},"alternative-id":["ita1984180403271"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1984180403271","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}