No CrossRef data available.
Article contents
Parikh test sets for commutative languages
Published online by Cambridge University Press: 03 June 2008
Abstract
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.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 3: JM'06 , July 2008 , pp. 525 - 537
- Copyright
- © EDP Sciences, 2008