Sciweavers

CAV
2010
Springer
181views Hardware» more  CAV 2010»
13 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...
Pierre Ganty, Rupak Majumdar, Benjamin Monmege