Pumping visibly pushdown languages
Stefan D. Bruda · 2011
Visibly pushdown languages are a subclass of context-free languages and are particularly well suited for specification and verification of application software. We find that, in addition to the pumping theorem inherited from context-free languages, visibly pushdown languages have some specific pumping properties. These properties have consequences in the recursive constructs of a process algebra based on visibly pushdown languages.