1 citations · 2 across the 3 of their papers we have counts for
4 papers
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…
Hyper-Minimization for Deterministic Weighted Tree Automata
Andreas Maletti, Daniel Quernheim
Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provide…
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…
Optimal Hyper-Minimization
Andreas Maletti, Daniel Quernheim
Minimal deterministic finite automata (DFAs) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in…