164 search results - page 2 / 33 » Quotient Complexity of Regular Languages |
TCS
2008
13 years 5 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
CORR
2010
Springer
13 years 5 months 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...
CSR
2008
Springer
13 years 6 months ago
2008
Springer
CORR
2011
Springer
13 years 4 days ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
