"\u0410\u0432\u0442\u043E\u043C\u0430\u0442 \u0434\u0435\u0442\u0435\u0440\u043C\u0456\u043D\u043E\u0432\u0430\u043D\u0438\u0439 \u2014 \u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442, \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u043F\u0435\u0440\u0435\u0445\u043E\u0434\u0443 \u044F\u043A\u043E\u0433\u043E \u0454 \u0432\u0441\u044E\u0434\u0438 \u0432\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u0430 (\u043E\u0434\u043D\u043E\u0437\u043D\u0430\u0447\u043D\u0430) \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u03A8: Q \u00D7 X \u2192 Q, \u0434\u0435 Q \u2014 \u043C\u043D\u043E\u0436\u0438\u043D\u0430 \u0441\u0442\u0430\u043D\u0456\u0432, \u0456 X \u043C\u043D\u043E\u0436\u0438\u043D\u0430 \u0432\u0445\u0456\u0434\u043D\u0438\u0445 \u043B\u0456\u0442\u0435\u0440 (\u0432\u0445\u0456\u0434\u043D\u0430 \u0430\u0431\u0435\u0442\u043A\u0430)."@uk . "1152"^^ . . . . "3934722"^^ . . . . . . . . . "\u0414\u0435\u0442\u0435\u0440\u043C\u0456\u043D\u043E\u0432\u0430\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442"@uk . . "In computer science, a deterministic automaton is a concept of automata theory in which the outcome of a transition from one state to another is determined by the input. A common deterministic automaton is a deterministic finite automaton (DFA) which is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state. DFAs recognize the set of regular languages and no other languages. A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction."@en . . . "Deterministic automaton"@en . "1047262023"^^ . . . "In computer science, a deterministic automaton is a concept of automata theory in which the outcome of a transition from one state to another is determined by the input. A common deterministic automaton is a deterministic finite automaton (DFA) which is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state. DFAs recognize the set of regular languages and no other languages. A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction."@en . "\u0410\u0432\u0442\u043E\u043C\u0430\u0442 \u0434\u0435\u0442\u0435\u0440\u043C\u0456\u043D\u043E\u0432\u0430\u043D\u0438\u0439 \u2014 \u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442, \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u043F\u0435\u0440\u0435\u0445\u043E\u0434\u0443 \u044F\u043A\u043E\u0433\u043E \u0454 \u0432\u0441\u044E\u0434\u0438 \u0432\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u0430 (\u043E\u0434\u043D\u043E\u0437\u043D\u0430\u0447\u043D\u0430) \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u03A8: Q \u00D7 X \u2192 Q, \u0434\u0435 Q \u2014 \u043C\u043D\u043E\u0436\u0438\u043D\u0430 \u0441\u0442\u0430\u043D\u0456\u0432, \u0456 X \u043C\u043D\u043E\u0436\u0438\u043D\u0430 \u0432\u0445\u0456\u0434\u043D\u0438\u0445 \u043B\u0456\u0442\u0435\u0440 (\u0432\u0445\u0456\u0434\u043D\u0430 \u0430\u0431\u0435\u0442\u043A\u0430)."@uk . . . . .