Weighted tree-walking automata
AbstractWe 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.
Download data is not yet available.
How to Cite
Fülöp, Z., & Muzamel, L. (2009). Weighted tree-walking automata. Acta Cybernetica, 19(2), 275-293. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3769