@inproceedings{b5c2c544ecb44f32a306ffb0616f87f2,
title = "Regularity problems for visibly pushdown languages",
abstract = "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.",
author = "Vince B{\'a}r{\'a}ny and Christof L{\"o}ding and Olivier Serre",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11672142\_34",
language = "English",
isbn = "3540323015",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "420--431",
booktitle = "STACS 2006",
note = "STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings ; Conference date: 23-02-2006 Through 25-02-2006",
}