The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON MATHEMATICS
Transactions ID Number: 27-370
Full Name: Stefan Bruda
Position: Associate Professor
Age: ON
Sex: Male
Address: Department of Computer Science, Bishop's University, 2600 College St, Sherbrooke, QC J1M 1Z7
Country: CANADA
Tel:
Tel prefix:
Fax:
E-mail address: bruda@cs.ubishops.ca
Other E-mails:
Title of the Paper: Further Properties of Visibly Pushdown Languages
Authors as they appear in the Paper: Stefan D Bruda and Md Tawhid Bin Waez
Email addresses of all the authors: bruda@cs.ubishops.ca, mtbwaez@cs.ubishops.ca
Number of paper pages: 11
Abstract: Visibly pushdown languages are a subclass of context-free languages that is closed under all the useful operations, namely union, intersection, complementation, renaming, concatenation, and Kleene star. The existence of a fully compositional process algebra based on such languages requires that these languages be also closed under slightly more esotheric operations, namely prefix, shuffle, and hiding. We prove here all these closure properties. We also give the semantics of visibly pushdown automata in terms of labelled transition systems. In effect, we prove the existence of a fully compositional process algebra based on visibly pushdown languages, and we also lay the foundations of such an algebra. We also find that, in addition to the pumping theorem borrowed from context-free languages, visibly pushdown languages have some additional pumping properties, which can have consequences on the recursive constructs of a visibly pushdown algebra.
Keywords: Visibly pushdown languages, Visibly pushdown automata, Closure properties, Prefix, Hiding, Shuffle, Pumping properties, Infinite-state process algebra, Trace equivalence, Bisimulation
EXTENSION of the file: .pdf
Special (Invited) Session: Visibly Pushdown Languages Are Closed under Prefix, Shuffle, and Hiding
Organizer of the Session: 591-950
How Did you learn about congress:
IP ADDRESS: 216.239.79.5
