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

DOI10.1007/978-3-030-30446-1_13MaRDI QIDQ6488979

Florent Avellaneda, Alexandre Petrenko

Publication date: 14 March 2024

Mathematics Subject Classification ID

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

Cites Work

• FSM inference from long traces
• Theory and Applications of Satisfiability Testing
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Unnamed Item
• Unnamed Item

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