Report on the exact methods for finding minimum-sized DFA

DOI10.1093/JIGPAL/JZAD014MaRDI QIDQ6639616zbMATH OpenFDO

Authors Wojciech Wieczorek, Łukasz Strąk, Arkadiusz Nowakowski

Publication date 15 November 2024

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/JIGPAL/JZAD014

zbMATH Keywords

ASP encodingexact search algorithmsfinite-state automaton inferencegrammatical inferenceparallel exbar algorithm

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• Efficient algorithms for the inference of minimum size DFAs
• Parallel algorithms for minimal nondeterministic finite automata inference
• Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach
• scientific article; zbMATH DE number 1955813
• Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach

Cited in

(1)

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

This page was built for publication: Report on the exact methods for finding minimum-sized DFA

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