Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach

DOI10.1007/978-3-030-30446-1_13MaRDI QIDQ6488979zbMATH OpenFDO

Authors Florent Avellaneda, Alexandre Petrenko

Publication date 14 March 2024

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational learning theory (68Q32)

Recommendations

• Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach
• Efficient symmetry breaking for SAT-based minimum DFA inference
• Report on the exact methods for finding minimum-sized DFA
• Efficient algorithms for the inference of minimum size DFAs
• Exact DFA Identification Using SAT Solvers

Cites work

• scientific article; zbMATH DE number 4123296 (Why is no real title available?)
• FSM inference from long traces
• Grammatical inference. Learning automata and grammars.
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Theory and Applications of Satisfiability Testing

Cited in

(2)

• Passive automata learning: DFAs and NFAs
• Report on the exact methods for finding minimum-sized DFA

This page was built for publication: Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488979)