Deciding emptiness for stack automata on infinite trees

DOI10.1006/inco.1994.1073zbMath0820.68079OpenAlexW2024395666MaRDI QIDQ1333263

David Harel, Danny Raz

Publication date: 13 September 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1073

zbMATH Keywords

pushdown automatainfinite treesemptiness problemstack automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Modular strategies for recursive game graphs ⋮ Efficient CTL model-checking for pushdown systems ⋮ Efficient CTL Model-Checking for Pushdown Systems

This page was built for publication: Deciding emptiness for stack automata on infinite trees