SEMANTIC ANALYSIS
SYMBOL TABLES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
False
|
|
|
True
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -Correct answer is (a) Statement: Both NFA and e-NFA recognize exactly the same languages. The best explanation: e-NFA do come up with a convenient feature but nothing new. They do not extend the class of languages that can be represented.
Detailed explanation-2: -Non-Deterministic Finite automata (NFA) and Deterministic Finite Automata (DFA) are equal in power that means, every NFA can be converted into its equivalent DFA and vice versa. Hence, statement 1 is true. Every regular language over ∑ can be accepted by a finite automaton. Therefore, both the statement is true.
Detailed explanation-3: -Theorem1: A language L is accepted by some NFA if and only if it is accepted by some DFA. In the theorem, there are two parts to prove: If L is accepted by DFA M, then L is accepted by some NFA M. If L is accepted by NFA M, then L is accepted by some DFA M .
Detailed explanation-4: -True. The associated language to DFAs and NFAs are regular.