COMPILER DESIGN

Detailed explanation-1: -Finite Automata Model: Finite automata can be represented by input tape and finite control. Input tape: It is a linear tape having some number of cells. Each input symbol is placed in each cell. Finite control: The finite control decides the next state on receiving particular input from input tape.

Detailed explanation-2: -A finite state machine is a triple M = (S, A, t), where S and A are nonempty finite sets and t : S × A → S is a function. Elements of S are called states. There is one distinguished element of S called the initial state. The set A is called the input alphabet, its elements are called letters.