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 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.
KeywordsRegular Language Tree Language Context Free Language Regularity Problem Pushdown Automaton
Unable to display preview. Download preview PDF.
- 2.Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of STOC 2004, pp. 202–211. ACM, New York (2004)Google Scholar
- 12.Pitcher, C.: Visibly pushdown expression effects for XML stream processing. In: Programming Language Technologies for XML, PLAN-X 2005, pp. 5–19 (2005)Google Scholar
- 14.Segoufin, L., Vianu, V.: Validating streaming XML documents. In: Proceedings of PODS 2002, pp. 53–64. ACM, New York (2002)Google Scholar