Free Access
Issue
RAIRO. Inform. théor.
Volume 18, Number 4, 1984
Page(s) 327 - 344
DOI https://doi.org/10.1051/ita/1984180403271
Published online 01 February 2017
  1. 1. J.-M. AUTEBERT, J. BEANQUIER, L. BOASSON et G. Sénizergues Remarques sur les langages de parenthèses. Theoretical Computer Science, vol. 31, 1984, p. 337-349. [MR: 752109] [Zbl: 0549.68072]
  2. 2. L. BOASSON, Grammaires à non-terminaux séparés, 7e ICALP, Lecture Notes in Computer Science, vol. 85, 1980, p. 105-118.
  3. 3. R. V. BOOK, N.T.S. Grammars and Church-Rosser Systems, Information Processing Letters, vol. 13, 1981, p. 73-76. [MR: 645814] [Zbl: 0476.68053]
  4. 4. R. MCNAUGHTON, Parenthesis grammars, Journal of the Association for Computing Machinery, vol. 14, 1967, p. 490-500. [MR: 234781] [Zbl: 0168.01206]
  5. 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. 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. [MR: 373387] [Zbl: 0291.68031]
  7. 7. M. TAKAHASHI, Nets-sets and relativized closure properties, Theoretical Computer Science, vol. 22, 1983, p. 253-264. [MR: 693059] [Zbl: 0497.68045]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.