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

How to cite

top

Autebert, J.-M., Boasson, L., and Sénizergues, G.. "Langages de parenthèses, langages N.T.S. et homomorphismes inverses." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 18.4 (1984): 327-344. <http://eudml.org/doc/92214>.

@article{Autebert1984,
author = {Autebert, J.-M., Boasson, L., Sénizergues, G.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {nest-sets; parenthesis languages; N.T.S. languages; inverse homomorphisms},
language = {fre},
number = {4},
pages = {327-344},
publisher = {EDP-Sciences},
title = {Langages de parenthèses, langages N.T.S. et homomorphismes inverses},
url = {http://eudml.org/doc/92214},
volume = {18},
year = {1984},
}

TY - JOUR
AU - Autebert, J.-M.
AU - Boasson, L.
AU - Sénizergues, G.
TI - Langages de parenthèses, langages N.T.S. et homomorphismes inverses
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1984
PB - EDP-Sciences
VL - 18
IS - 4
SP - 327
EP - 344
LA - fre
KW - nest-sets; parenthesis languages; N.T.S. languages; inverse homomorphisms
UR - http://eudml.org/doc/92214
ER -

References

top
  1. 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. 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. Zbl0476.68053MR645814
  4. 4. R. MCNAUGHTON, Parenthesis grammars, Journal of the Association for Computing Machinery, vol. 14, 1967, p. 490-500. Zbl0168.01206MR234781
  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. Zbl0291.68031MR373387
  7. 7. M. TAKAHASHI, Nets-sets and relativized closure properties, Theoretical Computer Science, vol. 22, 1983, p. 253-264. Zbl0497.68045MR693059

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.