Geodesic
The separability of formal languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 1, pp. 13-31.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1982__16_1_13_0,
     author = {Pinzani, R. and Sprugnoli, R.},
     title = {The separability of formal languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {13--31},
     publisher = {EDP-Sciences},
     volume = {16},
     number = {1},
     year = {1982},
     mrnumber = {677653},
     zbl = {0479.68079},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1982__16_1_13_0/}
}
TY  - JOUR
AU  - Pinzani, R.
AU  - Sprugnoli, R.
TI  - The separability of formal languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1982
SP  - 13
EP  - 31
VL  - 16
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1982__16_1_13_0/
LA  - en
ID  - ITA_1982__16_1_13_0
ER  - 
%0 Journal Article
%A Pinzani, R.
%A Sprugnoli, R.
%T The separability of formal languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1982
%P 13-31
%V 16
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1982__16_1_13_0/
%G en
%F ITA_1982__16_1_13_0
Pinzani, R.; Sprugnoli, R. The separability of formal languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 1, pp. 13-31. http://geodesic.mathdoc.fr/item/ITA_1982__16_1_13_0/

1. A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation and Compiling, Prentice-Hall, Englewood Cliffs, N.J., 1972. | MR

2. R. E. Griswold, J. F. Poage and J. P. Polonsky, The SNOBOL4 Programming Language, Prentice-Hall, Englewood Cliffs, N.J., 1971.

3. J. F. Gimpel, A Theory of Discrete Patterns and their Implementation in SNOBOL4Comm. ACM, Vol. 16, No. 2, 1973, pp. 91-100. | MR

4. A. Caracciolo Di Forino, Generalized Markov Algorithms and Automata. In Automata Theory, CAIANELLO, Ed., 1966, p. 115-130, Academic Press, New York. | Zbl

5. G. Aguzzi, R. Pinzani and R. Sprugnoli, An Algorithmic Approach to the Semantics of Programming Languages. In Automata, Languages and Programming NIVAT, Ed., 1973p. 147-166, North Holland Pub. Co., Amsterdam. | Zbl | MR

6. G. Aguzzi, F. Cesarini, R. Pinzani, G. Soda and R. Sprugnoli, Towards an Automatic Generation of Interpreters, Lecture Notes in Computer Science, No. 1, 1973, pp. 94-103, Springer Verlag, Berlin. | Zbl | MR

7. G. F. Rose: An Extension of Algol-Like Languages, Comm. ACM, Yol. 7, No. 2, 1964, pp. 52-61. | Zbl

8. S. Ginsburg: The Mathematical Theory of Context-Free Languages, McGraw Hill, New York, 1966. | Zbl | MR