Parikh test sets for commutative languages. (English) Zbl 1149.68068

Summary: A set \(T\subseteq 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.


68R15 Combinatorics on words
68Q45 Formal languages and automata
Full Text: DOI EuDML


[1] Ismo Hakala and Juha Kortelainen, Polynomial size test sets for commutative languages. RAIRO-Theor. Inf. Appl.31 (1997) 291-304. Zbl0889.68091 · Zbl 0889.68091
[2] Štěpán Holub and Juha Kortelainen, Linear size test sets for certain commutative languages. RAIRO-Theor. Inf. Appl.35 (2001) 453-475. Zbl1010.68103 · Zbl 1010.68103 · doi:10.1051/ita:2001105
[3] Michel Latteux, Rational cones and commutations. In Machines, languages, and complexity (Smolenice, 1988). Lect. Notes Comput. Sci.381 (1989) 37-54. Zbl0703.68012 · Zbl 0703.68012
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.