Ilya Zakirzyanov and Vladimir Ulyantsev took part in the DataMod seminar, which was held at the Conference on Software Engineering and Formal Methods (SEFM-2017). Their work "Finding all minimum-size DFA consistent with given examples" presented new results on research in the field of grammatical inference.
A new algorithm was proposed for the synthesis of finite automata by examples of behavior based on the use of effective methods for solving the feasibility problem. The main difference between the method and the known ones is the possibility of obtaining all possible minimal automata satisfying the initial data.
The article will be published in the Lecture Notes in Computer Science.