Minimization of symbolic tree automata
From MaRDI portal
Publication:4635952
Recommendations
Cited in
(13)- Succinct ordering and aggregation constraints in algebraic array theories
- Bisimulation Minimization of Tree Automata
- Forward bisimulations for nondeterministic symbolic finite automata
- Simulation algorithms for symbolic automata
- The suffix tree of a tree and minimizing sequential transducers
- Learning symbolic automata
- Minimization of symbolic automata
- Reasoning About Regular Properties: A Comparative Study
- Theoretical aspects of symbolic automata
- Inferring Symbolic Automata
- The learnability of symbolic automata
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Minimal Ascending and Descending Tree Automata
This page was built for publication: Minimization of symbolic tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635952)