On the Membership Problem for Visibly Pushdown Languages
From MaRDI portal
Publication:3522902
DOI10.1007/11901914_10zbMATH Open1161.68544OpenAlexW1529111663MaRDI QIDQ3522902FDOQ3522902
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
Recommendations
Cited In (12)
- 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
- 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
- Regularity Problems for Visibly Pushdown Languages
- Annotated regular expressions and input-driven languages
- Visibly pushdown languages
- Title not available (Why is that?)
- A Grammatical Representation of Visibly Pushdown Languages
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)