Deterministic automaton

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.

单词	Deterministic automaton
释义	Deterministic automaton 英语百科 Deterministic automaton 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.
随便看	screen separation screen separator screen separator mill screen set screen set bar screen settling screens screen shaker Screen Sharing screen sheet screen shield screen shoe screenshot Screen shot screen sickness screen sieve screen, sieve machine screens in Screen size screen size gradation screen sizer screen size television screen sizing screen sizing test screen slope adjusting shaft