13 citations · 46 across the 14 of their papers we have counts for
Showing 2013 · cs.FLShow all
2 papers · 2 filters
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…
cs.FL2013★ 1 cited
Composition Closure of Linear Extended Top-down Tree Transducers
Zoltán Fülöp, Andreas Maletti
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of suc…