Visibly Pushdown Automata: Universality and Inclusion via Antichains

DOI10.1007/978-3-642-37064-9_18zbMath1377.68104OpenAlexW92114844MaRDI QIDQ4910457

Véronique Bruyère, Marc Ducobu, Olivier Gauwin

Publication date: 18 March 2013

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37064-9_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Ramsey-Based Inclusion Checking for Visibly Pushdown Automata ⋮ On the decidability of infix inclusion problem

This page was built for publication: Visibly Pushdown Automata: Universality and Inclusion via Antichains