COMPILER DESIGN

Detailed explanation-1: -Finite automata represent exactly regular languages, and another way to describe regular languages is through regular expressions. As an example, (deterministic) finite automata can accept all and only the strings of 0’s and 1’s that have the sequence 01 somewhere in the string.

Detailed explanation-2: -A finite state acceptor is a finite state machine with no outputs. The user of a finite state acceptor caresonly about the final state: if the machine ends in an accepting state after processing a series of inputs, the machine is said to have accepted the input; otherwise, it is said to have rejected the input.

Detailed explanation-3: -Acceptability of a String by Finite Automata A string is accepted by a finite automaton, M = (Q, , , q0, F), if (q0, ) = F, where q0 is initial (start) state and F is the final state.

Detailed explanation-4: -Definition of Finite Automata A finite automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C.