Weighted tree-walking automata

Authors:
Zoltán Fülöp;Loránd Muzamel
Affiliations:
Department of Foundations of Computer Science, University of Szeged, Szeged, Hungary;Department of Foundations of Computer Science, University of Szeged, Szeged, Hungary
Venue:
Acta Cybernetica
Year:
2009

Citing 17
Cited 1

Weighted grammars and Kleene's theorem

Information Processing Letters
Tree languages

Handbook of formal languages, vol. 3
Automata theory for XML researchers

ACM SIGMOD Record
Tree-Walking Pebble Automata

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Typechecking for XML transformers

Journal of Computer and System Sciences - Special issue on PODS 2000
Formal tree series

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Determinization of finite state weighted tree automata

Journal of Automata, Languages and Combinatorics
A Kleene Theorem for Weighted Tree Automata

Theory of Computing Systems
A pumping lemma and decidability problems for recognizable tree series

Acta Cybernetica
Automata for XML---A survey

Journal of Computer and System Sciences
Weighted tree automata and weighted logics

Theoretical Computer Science
XML transformation by tree-walking transducers with invisible pebbles

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree-Walking Automata Do Not Recognize All Regular Languages

SIAM Journal on Computing
Pebble alternating tree-walking automata and their recognizing power

Acta Cybernetica
Circularity, composition, and decomposition results for pebble macro tree transducers

Journal of Automata, Languages and Combinatorics
Cut sets as recognizable tree languages

Fuzzy Sets and Systems
The myhill-nerode theorem for recognizable tree series

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Pebble weighted automata and transitive closure logics

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

Quantified Score

Hi-index	0.00

Visualization

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.