Alternating automata on infinite trees (Q1098325)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alternating automata on infinite trees |
scientific article |
Statements
Alternating automata on infinite trees (English)
0 references
1987
0 references
The conception of alternating automata on trees is developed in the paper. In the considered model of automata the transition function is a mapping from the state set into the free distributive lattice generated by all the possible pairs (direction, state). Languages (trees) accepted by such automata are investigated. A special attention is paid to the complementation operation.
0 references
completion of nondeterministic automata
0 references
infinite trees
0 references
alternating automata on trees
0 references
