Alternation bounds for tree automata
We consider alternation depth bounds for tree automata, that is, we limit the number of alternations of existential and universal computation steps. We show that a constant bound guarantees that the forest recognized is regular, whereas already a logarithmic bound enables the automata to recognize a...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1992
|
| Sorozat: | Acta cybernetica
10 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12505 |
| Tartalmi kivonat: | We consider alternation depth bounds for tree automata, that is, we limit the number of alternations of existential and universal computation steps. We show that a constant bound guarantees that the forest recognized is regular, whereas already a logarithmic bound enables the automata to recognize a strictly larger class of forests. As a corollary we obtain results on other types of alternation bounds for tree automata. We consider also commutation properties of independent computation steps of an alternating tree automaton. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 173-197 |
| ISSN: | 0324-721X |