Petr Grachev
YOU?
Author Swipe
Automata generation based on recurrent neural networks and automated cauterization selection Open
Intoduction: The regular inference problem is to synthesize deterministic finite-state automata by a list of words which are examplesand counterexamples of some unknown regular language. This problem is one of the main in the theory of for…
Neural network for synthesizing deterministic finite automata Open
Deterministic finite automata are widely used in control systems: from abstract protocols such as TCP to mechanical devices such as elevators or traffic lights. Some of these systems are quite complex and can be defined only in terms of fo…