7 citations · 13 across the 11 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.FL2012
Forward and Backward Application of Symbolic Tree Transducers
Zoltán Fülöp, Heiko Vogler
We consider symbolic tree automata (sta) and symbolic tree transducers (stt). We characterize s-recognizable tree languages (which are the tree languages recognizable by sta) in te…
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…
cs.FL2012
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
Manfred Droste, Heiko Vogler
Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure…