Finite Automata, Regular Languages and Type 3 Grammars
A finite automaton (fa), or finite state automaton (fsa), is an abstract computing device that receives a string of symbols as input, reads this string one symbol at a time from left to right, and after reading the last symbol halts and signifies either acceptance or rejection of the input. At any point in its computation a fa is in one of a finite number of states. The computations of a fa are directed by a “program,” which is a finite set of instructions for changing from state to state as the automaton reads input symbols. A computation always begins in a designated state, the initial state. There is also a specified set of final states; if the fa ends up in one of these after reading the input, it is accepted; otherwise, it is rejected.
KeywordsState Diagram Regular Language Finite Automaton Input String Finite State Automaton
Unable to display preview. Download preview PDF.