| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 19, Number 2, 2009>>> |
 Magyarul
|
Weighted Tree-Walking Automata
Zoltán Fülöp and Loránd Muzamel
Abstract (in LaTeX format)
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.
Kewords: semirings, regular tree series, weighted tree-walking automata.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Fulop:2009:ActaCybernetica,author = {Zolt\'an F\"ul\"op and Lor\'and Muzamel},
title = {Weighted Tree-Walking Automata},
journal = {Acta Cybernetica},
volume = {19},
number= {2},
pages = {275--293},
year = {2009},
abstract = {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.},
keywords = {semirings, regular tree series, weighted tree-walking automata}
}