Languages of finite words occurring infinitely many times in an infinite word

Klaus Thomsen

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

  • Volume: 39, Issue: 4, page 641-650
  • ISSN: 0988-3754

Abstract

top
We give necessary and sufficient conditions for a language to be the language of finite words that occur infinitely many times in an infinite word.

How to cite

top

Thomsen, Klaus. "Languages of finite words occurring infinitely many times in an infinite word." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 39.4 (2005): 641-650. <http://eudml.org/doc/244615>.

@article{Thomsen2005,
abstract = {We give necessary and sufficient conditions for a language to be the language of finite words that occur infinitely many times in an infinite word.},
author = {Thomsen, Klaus},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {formal languages; infinite words; infinite occurrence},
language = {eng},
number = {4},
pages = {641-650},
publisher = {EDP-Sciences},
title = {Languages of finite words occurring infinitely many times in an infinite word},
url = {http://eudml.org/doc/244615},
volume = {39},
year = {2005},
}

TY - JOUR
AU - Thomsen, Klaus
TI - Languages of finite words occurring infinitely many times in an infinite word
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2005
PB - EDP-Sciences
VL - 39
IS - 4
SP - 641
EP - 650
AB - We give necessary and sufficient conditions for a language to be the language of finite words that occur infinitely many times in an infinite word.
LA - eng
KW - formal languages; infinite words; infinite occurrence
UR - http://eudml.org/doc/244615
ER -

References

top
  1. [1] Y. Bar-Hilel, M. Peres and E. Shamir, On formal properties of simple phrase structure grammar. Z. Phonetik. Sprachwiss. Komm. 14 (1961) 143–172. Zbl0106.34501
  2. [2] T. Harju and L. Ilie, Languages obtained from infinite words. RAIRO-Inf. Theor. Appl. 31 (1997) 445–455. Zbl0903.68115
  3. [3] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company (1979). Zbl0426.68001MR645539
  4. [4] L. Ilie, On subwords of infinite words. Discrete Appl. Math. 63 (1995) 277–279. Zbl0856.68116
  5. [5] D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995). Zbl1106.37301MR1369092
  6. [6] S. Marcus and G. Paun, Infinite (almost periodic) words, formal languages and dynamical systems. Bull. EATCS 54 (1994) 224–231. Zbl0825.68388

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.