Free Access
RAIRO-Theor. Inf. Appl.
Volume 25, Number 5, 1991
Page(s) 397 - 418
Published online 01 February 2017
  1. 1. A. V. AHO, J. D. ULLMAN, The theory of parsing, translation and compiling, Prentice Hall, series in automatic computation. [Zbl: 0165.32001] [Google Scholar]
  2. 2. G. BERRY, R. SETHI, From regular expressions to deterministic automata (note), Theoret. Comput. Sci., 1986, 48 : 1, pp. 117-126. [MR: 889664] [Zbl: 0626.68043] [Google Scholar]
  3. 3. J. A. BRZOZOWSKI, Derivatives of regular expressions, J. A.C.M., 1964, 11 : 4, pp. 481-494. [MR: 174434] [Zbl: 0225.94044] [Google Scholar]
  4. 4. J. M. CHAMPARNAUD, Automate : un système de manipulation des automates finis, Rapport interne 85-48, LITP, Université Paris VII, 1985. [Google Scholar]
  5. 5. J. COHEN, F. GIANNESINI, Parser generation and grammar manipulations using Prolog's infinite trees, Logic Programming, octobre 1984, pp. 253-265. [Zbl: 0575.68087] [Google Scholar]
  6. 6. J. COHEN, T. J. HICKEY, Parsing and compiling using prolog, A.C.M. Trans. Progr. Lang. Systems, 1987, 9 : 2, pp. 125-163. [Google Scholar]
  7. 7. A. COLMERAUER, Prolog and Infinite Trees, Logic Programming, W. K. CLARK, S. A. TARNLUND Ed.), Academic Press, New York, 1982, pp. 231-251. [Google Scholar]
  8. 8. A. COLMERAUER, Introduction to Prolog III, Esprit 87-Archivement and Impact Proceedings of the 4th Annual Esprit Conference, 1987, 1 : 1, Bruxelles. [Zbl: 0679.68045] [Google Scholar]
  9. 9. S. COUPET-GRIMAL, Deux arguments pour les arbres infinis en Prolog, Thèse d'université, Université Aix-Marseille-II, 1988. [Google Scholar]
  10. 10. B. COURCELLE, Fundamental properties of infinite tees, Theor. Comput. Sci., 1985, 25, pp. 95-169. [MR: 693076] [Zbl: 0521.68013] [Google Scholar]
  11. 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. [Google Scholar]
  12. 12. E. LEISS, Regpack, an interactive package for regular languages and finite automata, Research report CS-77-32, Université de Waterloo, octobre 1977. [Google Scholar]
  13. 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: 0156.25501] [Google Scholar]
  14. 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. [Zbl: 0279.68010] [MR: 383813] [Google Scholar]
  15. 15. J. F. PIQUE, Drawing trees and their equations in Prolog, Proceedings of the second international logic programming conference, Uppsala University, 1984. [Google Scholar]
  16. 16. K. THOMSON, Regular expression search algorithm, Comm. A.C.M., 1968, 11 : 6, pp. 419-422. [Zbl: 0164.46205] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.