PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS (Q4020278): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:10, 6 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS |
scientific article |
Statements
PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS (English)
0 references
16 January 1993
0 references
Büchi automata
0 references
Muller automata
0 references
Rabin automata
0 references
top-down pushdown infinite tree automata
0 references
Landweber-Staiger-Wagner hierarchy
0 references
\(\omega\)-tree pushdown automata
0 references
infinite computations of nondeterministic context-free program schemes
0 references
equivalence problem
0 references