Infinitary tree languages recognized by \(\omega\)-automata (Q794179): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Ahmed Saoudi / rank | |||
Property / reviewed by | |||
Property / reviewed by: Markus Kunze / rank | |||
Property / author | |||
Property / author: Ahmed Saoudi / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Markus Kunze / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(84)90068-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987994907 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formal computations of non deterministic recursive program schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adherences of languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5517677 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A representation of trees by languages. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3948612 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on infinite trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3738547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3857704 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5616162 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank | |||
Normal rank |
Latest revision as of 12:59, 14 June 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