Sciweavers

Share
CAV
2010
Springer

Bounded Underapproximations

9 years 7 months ago
Bounded Underapproximations
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 Parikh (commutative) image as L. Bounded languages, introduced by Ginsburg and Spanier, are subsets of regular languages of the form w 1 w 2
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Added 02 Sep 2010
Updated 02 Sep 2010
Type Conference
Year 2010
Where CAV
Authors Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Comments (0)
books