We introduce saturation of 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 - and we show how saturation can make subsequent me... https://smokeysmountainfurnitureoutlets.shop/product-category/office-desk/