1 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
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…