Parikh test sets for commutative languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 3, pp. 525-537.

A set TL 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.

DOI : https://doi.org/10.1051/ita:2008011
Classification : 68R15
Mots clés : combinatorics on words, test sets, commutative languages
@article{ITA_2008__42_3_525_0,
     author = {Holub, \v{S}t\v{e}p\'an},
     title = {Parikh test sets for commutative languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {525--537},
     publisher = {EDP-Sciences},
     volume = {42},
     number = {3},
     year = {2008},
     doi = {10.1051/ita:2008011},
     zbl = {1149.68068},
     mrnumber = {2434033},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ita:2008011/}
}
TY  - JOUR
AU  - Holub, Štěpán
TI  - Parikh test sets for commutative languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2008
DA  - 2008///
SP  - 525
EP  - 537
VL  - 42
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ita:2008011/
UR  - https://zbmath.org/?q=an%3A1149.68068
UR  - https://www.ams.org/mathscinet-getitem?mr=2434033
UR  - https://doi.org/10.1051/ita:2008011
DO  - 10.1051/ita:2008011
LA  - en
ID  - ITA_2008__42_3_525_0
ER  - 
Holub, Štěpán. Parikh test sets for commutative languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 3, pp. 525-537. doi : 10.1051/ita:2008011. http://www.numdam.org/articles/10.1051/ita:2008011/

[1] Ismo Hakala and Juha Kortelainen, Polynomial size test sets for commutative languages. RAIRO-Theor. Inf. Appl. 31 (1997) 291-304. | Numdam | MR 1483261 | 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. | Numdam | MR 1908866 | Zbl 1010.68103

[3] Michel Latteux, Rational cones and commutations. In Machines, languages, and complexity (Smolenice, 1988). Lect. Notes Comput. Sci. 381 (1989) 37-54. | MR 1037563

Cité par Sources :