COMPILER DESIGN

Detailed explanation-1: -Explanation: We can represent one language in more one FSMs, example for a same language we have a DFA and an equivalent NFA. Explanation: The production of form non-terminal-> is call null production.

Detailed explanation-2: -The language accepted by an NFA M is the set of all strings which are accepted by M and is denoted by L (M ). state. For any string w, the nondeterministic automaton can be in a subset ⊆ Q of several possible states. If the final set contains a final state, then the automaton accepts the string.

Detailed explanation-3: -Which of the following techniques refer to the equivalence of DFA and N-DFA automata? Explanation: For every N-DFA there is a corresponding DFA for every N-DFA, and the basic technique is described as subset construction because each state in the DFA corresponds to some subset of states of the NDFA.

Detailed explanation-4: -Equivalence to DFA A deterministic finite automaton (DFA) can be seen as a special kind of NFA, in which for each state and symbol, the transition function has exactly one state. Thus, it is clear that every formal language that can be recognized by a DFA can be recognized by an NFA.