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...
Główni autorzy: | Barany, V, Loeding, C, Serre, O |
---|---|
Format: | Conference item |
Wydane: |
Springer
2006
|
Podobne zapisy
-
Beyond Language Equivalence on Visibly Pushdown Automata
od: Jiří Srba
Wydane: (2009-01-01) -
Visibly Pushdown Modular Games
od: Ilaria De Crescenzo, i wsp.
Wydane: (2014-08-01) -
Collapsible Pushdown Automata and Recursion Schemes
od: Murawski, C, i wsp.
Wydane: (2008) -
Winning Regions of Higher−Order Pushdown Games
od: Meyer, C, i wsp.
Wydane: (2008) -
Collapsible pushdown automata and recursion schemes
od: Hague, M, i wsp.
Wydane: (2017)