Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach
From MaRDI portal
Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach
Recommendations
- Efficient algorithms for the inference of minimum size DFAs
- Minimal consistent DFA from sample strings
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- Minimal consistent DFA revisited
- Exact DFA Identification Using SAT Solvers
- SAT-based minimization of deterministic -automata
- Finding DFAs with maximal shortest synchronizing word length
- Description and analysis of a bottom-up DFA minimization algorithm
- Efficient minimization of DFAs with partial transition
- A sufficient condition to polynomially compute a minimum separating DFA
Cited in
(9)- On distinguishing sets of structures by first-order sentences of minimal quantifier rank
- BFS-based symmetry breaking predicates for DFA identification
- Exact DFA Identification Using SAT Solvers
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- Passive automata learning: DFAs and NFAs
- Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach
- Report on the exact methods for finding minimum-sized DFA
- Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
- Computing the base-\(b\) representation of quadratic irrationals using automata
This page was built for publication: Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989704)
