{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"ctlab/DFA-Inductor","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mvcisback/dfa-identify","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"9eda4cf3f7442a7a1f611cd6dbc0136ad2f04d812c507e70538e5caee433e134","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}