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

Voir la notice de l'article provenant de la source Numdam

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.

DOI : 10.1051/ita:2008011
Classification : 68R15
Keywords: 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},
     mrnumber = {2434033},
     zbl = {1149.68068},
     language = {en},
     url = {http://geodesic.mathdoc.fr/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
SP  - 525
EP  - 537
VL  - 42
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita:2008011/
DO  - 10.1051/ita:2008011
LA  - en
ID  - ITA_2008__42_3_525_0
ER  - 
%0 Journal Article
%A Holub, Štěpán
%T Parikh test sets for commutative languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2008
%P 525-537
%V 42
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita:2008011/
%R 10.1051/ita:2008011
%G en
%F ITA_2008__42_3_525_0
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

Cité par Sources :