THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS
Boris Feliksovich Melnikov · International Journal of Foundations of Computer Science · 1993
Some special sets of ω-words, namely, the sets that can be obtained by catenating nonempty finite sets of words, an infinite number of times, are considered. A condition for the equality of two such sets of ω-words is obtained.