Technical Report 2011-001 Pumping Visibly Pushdown Languages
Stefan D. Bruda, J Quebec · 2011
Visibly pushdown languages are a subclass of context-free languages and are particularly well suited for specification and verification of application sof tware. 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 consequ ences in the recursive constructs of a process algebra based on visibly pushdown languages.