Prolog infinite trees and automata
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1991)
- Volume: 25, Issue: 5, page 397-418
- ISSN: 0988-3754
Access Full Article
top
How to cite
topCoupet-Grimal, Solange. "Prolog infinite trees and automata." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 25.5 (1991): 397-418. <http://eudml.org/doc/92398>.
@article{Coupet1991,
author = {Coupet-Grimal, Solange},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {regular expression; minimal deterministic finite state automaton; language defined by a rational expression; infinite trees; Prolog},
language = {eng},
number = {5},
pages = {397-418},
publisher = {EDP-Sciences},
title = {Prolog infinite trees and automata},
url = {http://eudml.org/doc/92398},
volume = {25},
year = {1991},
}
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
PB - EDP-Sciences
VL - 25
IS - 5
SP - 397
EP - 418
LA - eng
KW - regular expression; minimal deterministic finite state automaton; language defined by a rational expression; infinite trees; Prolog
UR - http://eudml.org/doc/92398
ER -
References
top- 1. A. V. AHO, J. D. ULLMAN, The theory of parsing, translation and compiling, Prentice Hall, series in automatic computation. Zbl0165.32001
- 2. G. BERRY, R. SETHI, From regular expressions to deterministic automata (note), Theoret. Comput. Sci., 1986, 48 : 1, pp. 117-126. Zbl0626.68043MR889664
- 3. J. A. BRZOZOWSKI, Derivatives of regular expressions, J. A.C.M., 1964, 11 : 4, pp. 481-494. Zbl0225.94044MR174434
- 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. Zbl0575.68087
- 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. Zbl0679.68045
- 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. Zbl0521.68013MR693076
- 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. Zbl0156.25501
- 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. Zbl0279.68010MR383813
- 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. Zbl0164.46205
NotesEmbed ?
topYou 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.