The word problem for visibly pushdown languages described by grammars
From MaRDI portal
Publication:2461562
DOI10.1007/s10703-007-0040-7zbMath1131.68053MaRDI QIDQ2461562
Margherita Napoli, Salvatore La Torre
Publication date: 28 November 2007
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-007-0040-7
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
03D40: Word problems, etc. in computability and recursion theory
Uses Software
Cites Work
- Regular expressions into finite automata
- Formal properties of XML grammars and languages
- Model checking LTL with regular valuations for pushdown systems
- Bracketed context-free languages
- THE ABSTRACT THEORY OF AUTOMATA
- Visibly pushdown languages
- Log Space Recognition and Translation of Parenthesis Languages
- On the synthesis of strategies in infinite games
- Parenthesis Grammars
- A characterization of parenthesis languages
- Automata, Languages and Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item