Parikh test sets for commutative languages
Charles University, Faculty of Mathematics and Physics, Department of Algebra, Sokolovská 83, 175 86 Praha, Czech Republic;
A set T ⊆ L is a Parikh test set of L if c(T) is a test set of c(L). We give a characterization of Parikh test sets for arbitrary language in terms of its Parikh basis, and the coincidence graph of letters.
Mathematics Subject Classification: 68R15
Key words: Combinatorics on words / test sets / commutative languages.
© EDP Sciences, 2008