Weighted tree-walking automata
We define weighted tree-walking automata. We show that the class of tree series recognizable by weighted tree-walking automata over a commutative semiring K is a subclass of the class of regular tree series over K. If K is not a ring, then the inclusion is strict.
Saved in:
| Main Authors: | |
|---|---|
| Corporate Author: | |
| Format: | Article |
| Published: |
2009
|
| Series: | Acta cybernetica
19 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12866 |
| Summary: | We define weighted tree-walking automata. We show that the class of tree series recognizable by weighted tree-walking automata over a commutative semiring K is a subclass of the class of regular tree series over K. If K is not a ring, then the inclusion is strict. |
|---|---|
| Physical Description: | 275-293 |
| ISSN: | 0324-721X |