Minimization of deterministic top-down tree automata
We consider offline sensing unranked top-down tree automata in which the state transitions are computed by bimachines. We give a polynomial time algorithm for minimizing such tree automata when they are state-separated.
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2017
|
| Sorozat: | Acta cybernetica
23 No. 1 |
| Kulcsszavak: | Automaták elmélete - véges, Algebra, Véges automaták, Matematikai logika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.1.2017.21 |
| Online Access: | http://acta.bibl.u-szeged.hu/50079 |
| Tartalmi kivonat: | We consider offline sensing unranked top-down tree automata in which the state transitions are computed by bimachines. We give a polynomial time algorithm for minimizing such tree automata when they are state-separated. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 379-401 |
| ISSN: | 0324-721X |