Decision Problems for Deterministic Pushdown Automata on Infinite Words

@inproceedings{Loding2014DecisionPF,
  title={Decision Problems for Deterministic Pushdown Automata on Infinite Words},
  author={Christof Loding},
  year={2014}
}
The article surveys some decidability results for DPDAs on infinite words (omega-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak omega-DPDAs. Furthermore, we present some new results on the parity index problem for omega-DPDAs. For the specification of a parity condition, the states of the omega-DPDA are assigned priorities (natural numbers), and a run is accepting if the highest priority that appears infinitely… 

Figures from this paper