1 paper
Ricardo Almeida, Lukáš Holík, Richard Mayr
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotie…