A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Separating the Words of a Language by Counting Factors
Tekijät: Saarela Aleksi
Kustantaja: IOS PRESS
Julkaisuvuosi: 2021
Journal: Fundamenta Informaticae
Tietokannassa oleva lehden nimi: FUNDAMENTA INFORMATICAE
Lehden akronyymi: FUND INFORM
Vuosikerta: 180
Numero: 4
Aloitussivu: 375
Lopetussivu: 393
Sivujen määrä: 19
ISSN: 0169-2968
DOI: https://doi.org/10.3233/FI-2021-2047
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/66682260
Tiivistelmä
For a given language L, we study the languages X such that for all distinct words u; v is an element of L, there exists a word x is an element of X that appears a different number of times as a factor in u and in v. In particular, we are interested in the following question: For which languages L does there exist a finite language X satisfying the above condition? We answer this question for all regular languages and for all sets of factors of infinite words.
For a given language L, we study the languages X such that for all distinct words u; v is an element of L, there exists a word x is an element of X that appears a different number of times as a factor in u and in v. In particular, we are interested in the following question: For which languages L does there exist a finite language X satisfying the above condition? We answer this question for all regular languages and for all sets of factors of infinite words.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
Turun yliopiston Tutkimustietojärjestelmän portaali