Langages de parenthèses, langages N.T.S. et homomorphismes inverses
J.-M. Autebert; L. Boasson; G. Sénizergues
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1984)
- Volume: 18, Issue: 4, page 327-344
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 1. J.-M. AUTEBERT, J. BEANQUIER, L. BOASSON et G. SénizerguesRemarques sur les langages de parenthèses. Theoretical Computer Science, vol. 31, 1984, p. 337-349. Zbl0549.68072MR752109
- 2. L. BOASSON, Grammaires à non-terminaux séparés, 7e ICALP, Lecture Notes in Computer Science, vol. 85, 1980, p. 105-118.
- 3. R. V. BOOK, N.T.S. Grammars and Church-Rosser Systems, Information Processing Letters, vol. 13, 1981, p. 73-76. Zbl0476.68053MR645814
- 4. R. MCNAUGHTON, Parenthesis grammars, Journal of the Association for Computing Machinery, vol. 14, 1967, p. 490-500. Zbl0168.01206MR234781
- 5. G. SÉNIZERGUES, Décidabilité de l'équivalence des grammaires N.T.S, Thèse de 3e cycle de l'Université Paris 7, 1981.
- 6. M. TAKAHASHI, Generalisations of regular sets and their applicationto a study of context-free languages, Information and Control, vol. 27, 1975, p. 1-36. Zbl0291.68031MR373387
- 7. M. TAKAHASHI, Nets-sets and relativized closure properties, Theoretical Computer Science, vol. 22, 1983, p. 253-264. Zbl0497.68045MR693059