On the Membership Problem for Visibly Pushdown Languages

DOI10.1007/11901914_10MaRDI QIDQ3522902zbMATH OpenOpenAlexFDO

Authors Salvatore La Torre, Margherita Napoli, Mimmo Parente

Publication date 4 September 2008

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11901914_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The word problem for visibly pushdown languages described by grammars
• Visibly pushdown languages
• Regularity Problems for Visibly Pushdown Languages
• P-hardness of the emptiness problem for visibly pushdown languages
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Cited in

(14)

• A Grammatical Representation of Visibly Pushdown Languages
• Additive number theory via automata theory
• Automata, Languages and Programming
• The word problem for visibly pushdown languages described by grammars
• Sums of Palindromes: an Approach via Automata
• P-hardness of the emptiness problem for visibly pushdown languages
• Membership problems for regular and context-free trace languages
• On the complexity of membership and counting in height-deterministic pushdown automata
• Rewriting of visibly pushdown languages for XML data integration
• Invisible pushdown languages
• Regularity Problems for Visibly Pushdown Languages
• Annotated regular expressions and input-driven languages
• Visibly pushdown languages
• scientific article; zbMATH DE number 18634 (Why is no real title available?)

This page was built for publication: On the Membership Problem for Visibly Pushdown Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522902)