Regularity Problems for Visibly Pushdown Languages

Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automaton that us...

Full description

Bibliographic Details
Main Authors: Barany, V, Loeding, C, Serre, O
Format: Conference item
Published: Springer 2006