Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices (Q1068544): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(82)90097-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2167227381 / rank | |||
Normal rank | |||
Revision as of 23:57, 19 March 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
