Reducing Nondeterministic Tree Automata by Adding Transitions
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 a...
Main Author: | Ricardo Manuel de Oliveira Almeida |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2016-12-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1612.04981v1 |
Similar Items
-
Random Generation of Nondeterministic Finite-State Tree Automata
by: Thomas Hanneforth, et al.
Published: (2013-11-01) -
Simplifying Nondeterministic Finite Cover Automata
by: Cezar Câmpeanu
Published: (2014-05-01) -
D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
by: Hanan Shabana
Published: (2018-12-01) -
Equivalence of Deterministic and Nondeterministic Epsilon Automata
by: Trybulec Michał
Published: (2009-01-01) -
Graph Learning by a Set of Automata. The Nondeterministic Case
by: Igor Burdonov, et al.
Published: (2018-10-01)