Languages obtained from infinite words

: Harju T, Ilie L

Publisher: GAUTHIER-VILLARS/EDITIONS ELSEVIER

: 1997

RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS

: RAIRO-INF THEOR APPL

: 31

: 5

: 445

: 455

: 11

: 0988-3754

DOI: https://doi.org/10.1051/ita/1997310504451

We prove that it is decidable whether or not a regular language can be written as the set of all finite factors of an infinite word. The result holds for both right-infinite and bi-infinite words.

Mathematics