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

• Type: Conference
• Year: 2010
• Where: CAV
• Authors: Pierre Ganty, Rupak Majumdar, Benjamin Monmege
• Keywords: CAV 2010, Context-free Language L, Context-free Languages, Context-free Subset, Hardware