Languages obtained from infinite words

T. Harju; L. Ilie

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1997)

  • Volume: 31, Issue: 5, page 445-455
  • ISSN: 0988-3754

How to cite

top

Harju, T., and Ilie, L.. "Languages obtained from infinite words." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 31.5 (1997): 445-455. <http://eudml.org/doc/92572>.

@article{Harju1997,
author = {Harju, T., Ilie, L.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {5},
pages = {445-455},
publisher = {EDP-Sciences},
title = {Languages obtained from infinite words},
url = {http://eudml.org/doc/92572},
volume = {31},
year = {1997},
}

TY - JOUR
AU - Harju, T.
AU - Ilie, L.
TI - Languages obtained from infinite words
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1997
PB - EDP-Sciences
VL - 31
IS - 5
SP - 445
EP - 455
LA - eng
UR - http://eudml.org/doc/92572
ER -

References

top
  1. [AuGa] J.-M. AUTEBERT and J. GABARRO, Iterated GSM's and Co-CFL, Acta Informatica, 1989, 26, pp. 749-769. Zbl0659.68097MR1021789
  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. Zbl0653.68076MR896136
  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. Zbl0624.68067MR889923
  4. [Bea2] D. BEAUQUIER, Minimal automaton of a rational cover, Proc. ICALP'87, Lecture Notes in Computer Science 267, 1987, pp. 174-189. Zbl0635.68088MR912707
  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. Zbl0571.68066MR819238
  6. [Ber] J. BERSTEL, Every iterated morphism yields a Co-CFL, Inf. Process. Lett., 1986, 22, pp. 7-9. Zbl0584.68082MR825639
  7. [BoNi] L. BOASSON and M. NIVAT, Adherence of languages, J. Comput. Syst. Sci., 1980, 20, pp. 285-309. Zbl0471.68052MR584863
  8. [Ei] S. EILENBERG, Automata, Languages and Machines, Vol. 1, Academic Press, New York, 1974. Zbl0317.94045MR530382
  9. [HoUl] J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979. Zbl0426.68001MR645539
  10. [Lo] M. LOTHAIRE, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983. Zbl0514.20045MR675953
  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. Zbl0825.68388
  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. Zbl0927.68050
  13. [Sa] A. SALOMAA, Formal Languages, Academic Press, New York, 1973. Zbl0262.68025MR438755

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.