Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach

DOI10.1007/978-3-319-74781-1_9zbMath1461.68110OpenAlexW2786305034MaRDI QIDQ4989704

Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto

Publication date: 26 May 2021

Published in: Software Engineering and Formal Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-74781-1_9

zbMATH Keywords

symmetry breakingBoolean satisfiabilitygrammatical inferenceautomata identification

Mathematics Subject Classification ID

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

Related Items (1)

On distinguishing sets of structures by first-order sentences of minimal quantifier rank

This page was built for publication: Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach