no. 5
Prolog infinite trees and automata
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 5, pp. 397-418. 
@article{ITA_1991__25_5_397_0,
     author = {Coupet-Grimal, Solange},
     title = {Prolog infinite trees and automata},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {397--418},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {5},
     year = {1991},
     mrnumber = {1144006},
     zbl = {0764.68087},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1991__25_5_397_0/}
}
TY  - JOUR
AU  - Coupet-Grimal, Solange
TI  - Prolog infinite trees and automata
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 397
EP  - 418
VL  - 25
IS  - 5
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1991__25_5_397_0/
LA  - en
ID  - ITA_1991__25_5_397_0
ER  - 
%0 Journal Article
%A Coupet-Grimal, Solange
%T Prolog infinite trees and automata
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 397-418
%V 25
%N 5
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1991__25_5_397_0/
%G en
%F ITA_1991__25_5_397_0
Coupet-Grimal, Solange. Prolog infinite trees and automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 5, pp. 397-418. http://www.numdam.org/item/ITA_1991__25_5_397_0/

1. A. V. Aho, J. D. Ullman, The theory of parsing, translation and compiling, Prentice Hall, series in automatic computation.

2. G. Berry, R. Sethi, From regular expressions to deterministic automata (note), Theoret. Comput. Sci., 1986, 48 : 1, pp. 117-126. | MR | Zbl

3. J. A. Brzozowski, Derivatives of regular expressions, J. A.C.M., 1964, 11 : 4, pp. 481-494. | MR | Zbl

4. J. M. Champarnaud, Automate : un système de manipulation des automates finis, Rapport interne 85-48, LITP, Université Paris VII, 1985.

5. J. Cohen, F. Giannesini, Parser generation and grammar manipulations using Prolog's infinite trees, Logic Programming, octobre 1984, pp. 253-265. | Zbl

6. J. Cohen, T. J. Hickey, Parsing and compiling using prolog, A.C.M. Trans. Progr. Lang. Systems, 1987, 9 : 2, pp. 125-163.

7. A. Colmerauer, Prolog and Infinite Trees, Logic Programming, W. K. CLARK, S. A. TARNLUND Ed.), Academic Press, New York, 1982, pp. 231-251.

8. A. Colmerauer, Introduction to Prolog III, Esprit 87-Archivement and Impact Proceedings of the 4th Annual Esprit Conference, 1987, 1 : 1, Bruxelles.

9. S. Coupet-Grimal, Deux arguments pour les arbres infinis en Prolog, Thèse d'université, Université Aix-Marseille-II, 1988.

10. B. Courcelle, Fundamental properties of infinite tees, Theor. Comput. Sci., 1985, 25, pp. 95-169. | MR | Zbl

11. G. Cousineau, Les arbres à feuilles indicées: un cadre algébrique pour l'étude des structures de contrôle, Thèse d'état, Université de Paris-VII, 1977.

12. E. Leiss, Regpack, an interactive package for regular languages and finite automata, Research report CS-77-32, Université de Waterloo, octobre 1977.

13. R. Mcnaughton, H. Yamada, Regular expressions and state graphs for automata, I.R.E.E. Trans. Comput., 1960, EC-9:1, pp. 38-47. | Zbl

14. M. Nivat, Langages algébriques sur le magma libre et sémantique des schémas de programmes, in automata, languages and programming, M. NIVAT Ed., Amsterdam, 1973. | MR

15. J. F. Pique, Drawing trees and their equations in Prolog, Proceedings of the second international logic programming conference, Uppsala University, 1984.

16. K. Thomson, Regular expression search algorithm, Comm. A.C.M., 1968, 11 : 6, pp. 419-422. | Zbl