Every commutative quasirational language is regular
Linear size test sets for certain commutative languages
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 elements. The result is then generalized to commutative languages containing a word such that (i) and (ii) each symbol occurs at least twice in if it occurs at least twice in some word of : each such possesses a test set of size , where . The considerations rest on the analysis of some basic types of word equations....
Polynomial size test sets for commutative languages
Linear size test sets for certain commutative languages
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 a test set...
On separating sets of words. III.
On separating sets of words. IV.
On separating sets of words. II.
On separating sets of words. I.
A note on finitely generated commutative rings
Transitive closures of binary relations. I.
Page 1