BFS-Based Symmetry Breaking Predicates for DFA Identification

DOI10.1007/978-3-319-15579-1_48zbMath1451.68163arXiv1602.05028OpenAlexW277443901MaRDI QIDQ2799212

Ilya Zakirzyanov, Vladimir Ulyantsev, Anatoly Shalyto

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.05028

zbMATH Keywords

learning automataBoolean satisfiabilitygrammatical inferencesymmetry-breaking techniques

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Computational aspects of satisfiability (68R07)

Related Items (2)

Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT ⋮ Induction and Exploitation of Subgoal Automata for Reinforcement Learning

This page was built for publication: BFS-Based Symmetry Breaking Predicates for DFA Identification