Regularity Problems for Visibly Pushdown Languages
- Cite this paper as:
- Bárány V., Löding C., Serre O. (2006) Regularity Problems for Visibly Pushdown Languages. In: Durand B., Thomas W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg
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 uses its stack only as counter. In particular, this allows to decide whether a given visibly pushdown language is a regular restriction of the set of well-matched words, meaning that the language can be accepted by a finite automaton if only well-matched words are considered as input.
Unable to display preview. Download preview PDF.