retagged by
3,176 views
4 votes
4 votes
What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?

A. 8

B. 9

C. 6

D. None
retagged by

3 Answers

Best answer
10 votes
10 votes

Second last symbol is 1 over {0,1, 2 }

regular expression = (0+1+2)*1(0+1+2).                     Anything Second last Last

For this regular expression NFA is

Convert NFA to DFA

selected by
1 votes
1 votes

B. 
Whenever the question says the nth symbol from the right side is fixed and the input language has m symbols the answer for minimal dfa is m . So 3= 9

Related questions

2 votes
2 votes
2 answers
1
Anurag_s asked Aug 15, 2015
3,228 views
Let Σ= {a}, assume language, L= { a^(2012.K) / K 0}, what is minimum number of states needed in a DFA to recognize L
0 votes
0 votes
0 answers
2
koushriek asked May 19, 2022
1,281 views
Examples of accepted words: 1011, 101101, 1111Example of non-accepted words: 101, 1001, 010The solution says the min-DFA contains 5 states but I could only do it in 4. Am...
1 votes
1 votes
1 answer
4
sripo asked Nov 6, 2018
2,977 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?