Linear size test sets for certain commutative languages
Štěpán Holub, Juha Kortelainen (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We prove that for each positive integer the finite commutative language = ( ...) possesses a test set of size at most Moreover, it is shown that each test set for has at least -1 elements. The result is then generalized to commutative languages containing a word such that (i) alph() = alph}(); and (ii) each symbol ∈ alph}() occurs at least twice in if it occurs at least twice in some word of : each such possesses...