Pumping visibly pushdown languages

Authors:
Stefan D. Bruda
Affiliations:
Department of Computer Science, Bishop's University, Sherbrooke, Quebec, Canada
Venue:
AIASABEBI'11 Proceedings of the 11th WSEAS international conference on Applied informatics and communications, and Proceedings of the 4th WSEAS International conference on Biomedical electronics and biomedical informatics, and Proceedings of the international conference on Computational engineering in systems applications
Year:
2011

Citing 4
Cited 0

Elements of the Theory of Computation

Elements of the Theory of Computation
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science)

Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science)
The word problem for visibly pushdown languages described by grammars

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.