Reducing Nondeterministic Tree Automata by Adding Transitions
We introduce saturation of Water Features nondeterministic tree automata, a technique that consists of adding new transitions to an automaton while preserving its language.We implemented our algorithm on minotaut - a module of the tree automata library libvata that reduces the size of automata by merging states and removing superfluous transitions