ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM (Q3348430)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM |
scientific article |
Statements
ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM (English)
0 references
1990
0 references
tree automata
0 references
Büchi automata
0 references
Muller automata
0 references
Rabin automata
0 references
