EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 31 / No 5 (1997) RAIRO-Theor. Inf. Appl., 31 5 (1997) 445-455 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 31, Number 5, 1997
Page(s) 445 - 455
DOI https://doi.org/10.1051/ita/1997310504451
Published online 01 February 2017
  1. [AuGa] J.-M. AUTEBERT and J. GABARRO, Iterated GSM's and Co-CFL, Acta Informatica, 1989, 26, pp. 749-769. [MR: 1021789] [Zbl: 0659.68097] [Google Scholar]
  2. [AFG] J.-M. AUTEBERT, P. FLAJOLET and J. GABARRO, Prefixes of infinite words and ambiguous context-free languages, Inf. Process. Lett, 1987, 25, pp. 211-216. [MR: 896136] [Zbl: 0653.68076] [Google Scholar]
  3. [Bea1] D. BEAUQUIER, Thin homogeneous sets of factors, Proc. of the 6th Conference of Foundations of Software Technology and Theoret. Comput. Sci., Lecture Notes in Computer Science 241, 1986, pp. 239-251. [MR: 889923] [Zbl: 0624.68067] [Google Scholar]
  4. [Bea2] D. BEAUQUIER, Minimal automaton of a rational cover, Proc. ICALP'87, Lecture Notes in Computer Science 267, 1987, pp. 174-189. [MR: 912707] [Zbl: 0635.68088] [Google Scholar]
  5. [BeaN] D. BEAUQUIER and M. NIVAT, About rational sets of factors of a bi-infinite word, Proc. ICALP'85, Lecture Notes in Computer Science 194, 1985, pp. 33-42. [MR: 819238] [Zbl: 0571.68066] [Google Scholar]
  6. [Ber] J. BERSTEL, Every iterated morphism yields a Co-CFL, Inf. Process. Lett., 1986, 22, pp. 7-9. [MR: 825639] [Zbl: 0584.68082] [Google Scholar]
  7. [BoNi] L. BOASSON and M. NIVAT, Adherence of languages, J. Comput. Syst. Sci., 1980, 20, pp. 285-309. [MR: 584863] [Zbl: 0471.68052] [Google Scholar]
  8. [Ei]S. EILENBERG, Automata, Languages and Machines, Vol. 1, Academic Press, New York, 1974. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  9. [HoUl] J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979. [MR: 645539] [Zbl: 0426.68001] [Google Scholar]
  10. [Lo] M. LOTHAIRE, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
  11. [MaPa1] S. MARCUS and Gh. PĂUN, Infinite (almost periodic) words, formal languages and dynamical systems, The Bulletin of the EATCS, 1994, 54, pp. 224-231. [Zbl: 0825.68388] [Google Scholar]
  12. [MaPa2] S. MARCUS and Gh. PĂUN, Infinite words and their associated formal language, in: C. Calude, M. J. J. Lennon, H. Maurer (eds.), Salodays in Auckland (Auckland Univ. Press, 1994), pp. 95-99. [Zbl: 0927.68050] [Google Scholar]
  13. [Sa] A. SALOMAA, Formal Languages, Academic Press, New York, 1973. [MR: 438755] [Zbl: 0262.68025] [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.