BFS-Based Symmetry Breaking Predicates for DFA Identification
- Cite this paper as:
- Ulyantsev V., Zakirzyanov I., Shalyto A. (2015) BFS-Based Symmetry Breaking Predicates for DFA Identification. In: Dediu AH., Formenti E., Martín-Vide C., Truthe B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science, vol 8977. Springer, Cham
It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be translated to Boolean satisfiability (SAT). Modern SAT-solvers can efficiently tackle hard DFA identification instances. We present a technique to reduce SAT search space by enforcing an enumeration of DFA states in breadth-first search (BFS) order. We propose symmetry breaking predicates, which can be added to Boolean formulae representing various DFA identification problems. We show how to apply this technique to DFA identification from both noiseless and noisy data. The main advantage of the proposed approach is that it allows to exactly determine the existence or non-existence of a solution of the noisy DFA identification problem.
KeywordsGrammatical inference Boolean satisfiability Learning automata Symmetry breaking techniques
Unable to display preview. Download preview PDF.