Weighted tree-walking automata

Zoltán Fülöp; Loránd Muzamel

Skip to main content Skip to main navigation menu Skip to site footer

Weighted tree-walking automata

Zoltán Fülöp
Loránd Muzamel

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.

Downloads

Download data is not yet available.

PDF

Published

2009-01-01

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

Download Citation

Issue

Vol 19 No 2 (2009)

Section

Regular articles

Most read articles by the same author(s)

Zoltán Fülöp, On attributed tree transducers , Acta Cybernetica: Vol 5 No 3 (1981)
Zoltán Fülöp, Decomposition results concerning K-visit attributed tree transducers , Acta Cybernetica: Vol 6 No 2 (1983)
Zoltán Fülöp, Sándor Vágvölgyi, Results on compositions of deterministic root-to-frontier tree transformations , Acta Cybernetica: Vol 8 No 1 (1987)
Sándor Vágvölgyi, Zoltán Fülöp, An infinite hierarchy of tree transformations in the class NDR , Acta Cybernetica: Vol 8 No 2 (1987)
Zoltán Fülöp, Sándor Vágvölgyi, On ranges of compositions of deterministic root-to-frontier tree transformations , Acta Cybernetica: Vol 8 No 3 (1988)
Zoltán Fülöp, István Babcsányi, Attila Nagy, Correction : Mealy-automata in which the output-equivalence is a congruence : I. Babcsányi, A. Nagy , Acta Cybernetica: Vol 12 No 1 (1995)
Zoltán Fülöp, Correction : Invariance groups of threshold functions : E. K. Horváth , Acta Cybernetica: Vol 12 No 1 (1995)
Zoltán Fülöp, On one-pass term rewriting , Acta Cybernetica: Vol 14 No 1 (1999)
Tibor Csendes, Zoltán Fülöp, Preface , Acta Cybernetica: Vol 14 No 2 (1999)
Tibor Csendes, Zoltán Fülöp, Preface , Acta Cybernetica: Vol 15 No 2 (2001)

1 2 > >>