Separating many words by counting occurrences of factors
Saarela A.
Separating many words by counting occurrences of factors
Saarela A.
Julkaisun pysyvä osoite on:
https://urn.fi/URN:NBN:fi-fe2021042824539
https://urn.fi/URN:NBN:fi-fe2021042824539
Tiivistelmä
For a given language L, we study the languages X such that for all distinct words u,v∈L , there exists a word x∈X appearing 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.
Kokoelmat
- Rinnakkaistallenteet [19207]