Infinitary tree languages recognized by \(\omega\)-automata (Q794179): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinitary tree languages recognized by \(\omega\)-automata |
scientific article |
Statements
Infinitary tree languages recognized by \(\omega\)-automata (English)
0 references
1984
0 references
Regular nondeterministic program schemata and the closely related regular tree languages in Nivat's sense are characterized by top-down infinite tree automata. Deterministic \(\omega\)-languages form a proper subclass of the recognizable infinitary tree languages and this gap cannot be bridged by taking the Boolean closure.
0 references
deterministic omega-languages
0 references
Rabin's special automata
0 references
Büchi's automata
0 references
regular recursive program schemata
0 references
Regular nondeterministic program schemata
0 references
regular tree languages
0 references
top-down infinite tree automata
0 references
recognizable infinitary tree languages
0 references
