COMPILER DESIGN

Detailed explanation-1: -Explanation: Finite automata doesn’t require any stack operation.

Detailed explanation-2: -A finite automaton has no memory other than which state is the current state. The strings in the language consist of some substring, then another substring, then the reverse of the first substring.

Detailed explanation-3: -Explanation: A finite automaton accepts the languages which are regular and for which a DFA can be constructed. Explanation: Following the rules of precedence, Kleene or star operation would be done first, then concatenation and finally union or plus operation.

Detailed explanation-4: -Memory in finite automata is present in the form of states Q only and according to automata principal: any automata can have only finite set of states. hence finite automata has finite memory, this is the reason automata for regular language is called finite automata.