A1 Refereed original research article in a scientific journal

Languages obtained from infinite words



Authors: Harju T, Ilie L

Publisher: GAUTHIER-VILLARS/EDITIONS ELSEVIER

Publication year: 1997

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

Journal name in source: RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS

Journal acronym: RAIRO-INF THEOR APPL

Volume: 31

Issue: 5

First page : 445

Last page: 455

Number of pages: 11

ISSN: 0988-3754

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


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


Research Areas



Last updated on 2025-13-10 at 12:34