Separating the Words of a Language by Counting Factors
Affiliation:
1. Department of Mathematics and Statistics, University of Turku, 20014 Turku, Finland. amsaar@utu.fi
Abstract
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 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.
Subject
Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science