PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
From MaRDI portal
Publication:4020278
DOI10.1142/S0129054192000048zbMath0769.68099OpenAlexW2078131135MaRDI QIDQ4020278
Publication date: 16 January 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054192000048
Büchi automataequivalence problemMuller automataRabin automataLandweber-Staiger-Wagner hierarchy\(\omega\)-tree pushdown automatainfinite computations of nondeterministic context-free program schemestop-down pushdown infinite tree automata
Related Items