CORR
2010
Springer
14 years 17 days ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...