1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.FL2017★ 1 cited
Pushing for weighted tree automata
Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized we…
cs.FL2013★ 1 cited
Random Generation of Nondeterministic Finite-State Tree Automata
Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable. The run-time results obtain…