Answer Posted / Lavi Kumari
A Finite Automaton is a mathematical model of computation that can be in one of a finite number of states. It consists of a set of states, an input alphabet, a start state, and transition rules that specify how the machine moves from one state to another based on the next input symbol.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers