activity
20122026
most citedWeighted Regular Tree Grammars with Storage

7 citations · 14 across the 7 of their papers we have counts for

collaborators

7 papers

cs.FL2026

The Value Generating Power of Weighted Tree Automata with Initial Algebra Semantics

Manfred Droste, Zoltán Fülöp, Andreja Tepavčević +1

We consider the generating power of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings) and the question under which condition…

cs.FL2024

The generating power of weighted tree automata with initial algebra semantics

Manfred Droste, Zoltán Fülöp, Andreja Tepavčević +1

We consider the images of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings). These images are subsets of the carrier set of…

cs.FL2022★ 1 cited

Weighted Tree Automata -- May it be a little more?

Zoltán Fülöp, Heiko Vogler

This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree autom…

cs.FL2019★ 5 cited

Crisp-determinization of weighted tree automata over strong bimonoids

Zoltán Fülöp, Dávid Kószó, Heiko Vogler

We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics and their run semantics. There are wta for which these semantics are different; h…

cs.FL2017★ 7 cited

Weighted Regular Tree Grammars with Storage

Zoltán Fülöp, Luisa Herrmann, Heiko Vogler

We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each we…

cs.FL2014★ 1 cited

Proceedings 14th International Conference on Automata and Formal Languages

Zoltán Ésik, Zoltán Fülöp

The 14th International Conference Automata and Formal Languages (AFL 2014) was held in Szeged, Hungary, from the 27th to the 29th of May, 2014. The conference was organized by the…

cs.FL2012

Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics

Zoltán Fülöp, Heiko Vogler

We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in…