Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices (Q1068544): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:01, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices |
scientific article |
Statements
Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices (English)
0 references
1982
0 references
Let a set of infinite trees be accepted by an automaton. We prove that then a deterministic sinking automaton accepting the set can be effectively constructed.
0 references
deterministic sinking automaton
0 references
