Parikh Images of Regular Languages: Complexity and Applications

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 total size 2O(k2 log n)

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Anthony Widjaja To
• Keywords: CORR 2010, Education, Finite Union, Parikh Image, Total Size