LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Q’ = P(Q)
|
|
|
’ = ’ (R, a) = {q Q | q (r, a), for some r R}
|
|
|
Q’={q0}
|
|
|
All of the mentioned
|
Detailed explanation-1: -9. Let N (Q, ∑, , q0, A) be the NFA recognizing a language L. Then for a DFA (Q’, ∑, ’, q0’, A’), which among the following is true? Explanation: All the optioned mentioned are the instruction formats of how to convert a NFA to a DFA.
Detailed explanation-2: -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-3: -What is the relation between NFA-accepted languages and DFA accepted languages? Explanation: The no of languages accepted by NFA and DFA is equal.
Detailed explanation-4: -Answer: The NFA M below recognizes the language C = w ∈ ∗ | w ends with 00 , where = 0, 1.
Detailed explanation-5: -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.