Langages de parenthèses, langages N.T.S. et homomorphismes inverses
RAIRO. Informatique théorique, Tome 18 (1984) no. 4, pp. 327-344. 
@article{ITA_1984__18_4_327_0,
     author = {Autebert, J.-M. and Boasson, L. and S\'enizergues, G.},
     title = {Langages de parenth\`eses, langages {N.T.S.} et homomorphismes inverses},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {327--344},
     publisher = {EDP-Sciences},
     volume = {18},
     number = {4},
     year = {1984},
     mrnumber = {775836},
     zbl = {0547.68075},
     language = {fr},
     url = {http://archive.numdam.org/item/ITA_1984__18_4_327_0/}
}
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. Informatique théorique
PY  - 1984
SP  - 327
EP  - 344
VL  - 18
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1984__18_4_327_0/
LA  - fr
ID  - ITA_1984__18_4_327_0
ER  - 
%0 Journal Article
%A Autebert, J.-M.
%A Boasson, L.
%A Sénizergues, G.
%T Langages de parenthèses, langages N.T.S. et homomorphismes inverses
%J RAIRO. Informatique théorique
%D 1984
%P 327-344
%V 18
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1984__18_4_327_0/
%G fr
%F ITA_1984__18_4_327_0
Autebert, J.-M.; Boasson, L.; Sénizergues, G. Langages de parenthèses, langages N.T.S. et homomorphismes inverses. RAIRO. Informatique théorique, Tome 18 (1984) no. 4, pp. 327-344. http://archive.numdam.org/item/ITA_1984__18_4_327_0/

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 | Zbl

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. | MR | Zbl

4. R. Mcnaughton, Parenthesis grammars, Journal of the Association for Computing Machinery, vol. 14, 1967, p. 490-500. | MR | Zbl

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. | MR | Zbl

7. M. Takahashi, Nets-sets and relativized closure properties, Theoretical Computer Science, vol. 22, 1983, p. 253-264. | MR | Zbl