LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Number of states require to accept string ends with 10.
|
|
3
|
|
|
2
|
|
|
1
|
|
|
4
|
Explanation:
Detailed explanation-1: -3. Number of states require to accept string ends with 10. d) can’t be represented. Explanation: This is minimal finite automata.
Detailed explanation-2: -The correct answer would be 3. Minimum number of states in FA will be 3.
Detailed explanation-3: -∴ Minimum number of states required for DFA = 3.
Detailed explanation-4: -All strings ending with ‘n’ length substring will always require minimum (n+1) states in the DFA.
There is 1 question to complete.