{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/symmetry-breaking-predicates-for-sat-based","title":"Symmetry Breaking Predicates for SAT-based DFA Identification","arxiv_id":"1602.05028","date":"2016-02-16","proceeding":null,"authors":["Vladimir Ulyantsev","Ilya Zakirzyanov","Anatoly Shalyto"],"abstract":"It was shown before that the NP-hard problem of deterministic finite automata\n(DFA) identification can be effectively translated to Boolean satisfiability\n(SAT). Modern SAT-solvers can tackle hard DFA identification instances\nefficiently. We present a technique to reduce the problem search space by\nenforcing an enumeration of DFA states in depth-first search (DFS) or\nbreadth-first search (BFS) order. We propose symmetry breaking predicates,\nwhich can be added to Boolean formulae representing various DFA identification\nproblems. We show how to apply this technique to DFA identification from both\nnoiseless and noisy data. Also we propose a method to identify all automata of\nthe desired size. The proposed approach outperforms the current\nstate-of-the-art DFASAT method for DFA identification from noiseless data. A\nbig advantage of the proposed approach is that it allows to determine exactly\nthe existence or non-existence of a solution of the noisy DFA identification\nproblem unlike metaheuristic approaches such as genetic algorithms.","url_abs":"http://arxiv.org/abs/1602.05028v2","url_pdf":"http://arxiv.org/pdf/1602.05028v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"symmetry-breaking-predicates-for-sat-based","repo_url":"https://github.com/ctlab/DFA-Inductor","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"symmetry-breaking-predicates-for-sat-based","repo_url":"https://github.com/mvcisback/dfa-identify","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"dfa","method_name":"FA"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}