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 |
| LEADER | 01262nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12505 | ||
| 005 | 20220613101357.0 | ||
| 008 | 161015s1992 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Salomaa Kai | |
| 245 | 1 | 0 | |a Alternation bounds for tree automata |h [elektronikus dokumentum] / |c Salomaa Kai |
| 260 | |c 1992 | ||
| 300 | |a 173-197 | ||
| 490 | 0 | |a Acta cybernetica |v 10 No. 3 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Automaták | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12505/1/cybernetica_010_numb_003_173-197.pdf |z Dokumentum-elérés |