96 search results - page 1 / 20 » Parikh Images of Regular Languages: Complexity and Applicati... |
CORR
2010
Springer
13 years 7 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...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
CAV
2010
Springer
13 years 10 months ago
2010
Springer
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L L which has the same...
IPL
2007
13 years 7 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...