| Issue |
RAIRO-Theor. Inf. Appl.
Volume 42, Number 3, July-September 2008
JM'06
|
|
|---|---|---|
| Page(s) | 525 - 537 | |
| DOI | https://doi.org/10.1051/ita:2008011 | |
| Published online | 03 June 2008 | |
Parikh test sets for commutative languages
Charles University, Faculty of Mathematics and Physics, Department of Algebra, Sokolovská 83, 175 86 Praha, Czech Republic;
holub@karlin.mff.cuni.cz
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.