Recent questions tagged minimal-state-automata

1 votes
2 answers
152
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.(a) 6 (b) 7(c) 8 (d) 9
0 votes
1 answer
154
2 votes
2 answers
155
0 votes
0 answers
156
5 votes
2 answers
157
3 votes
1 answer
158
Find minimal finitte automata forL1:L1 contains set of strings starting with 1010 and length of string is divisible by 4.L2:L2 contains set of strings starting woth 1010 ...
1 votes
1 answer
159
no of states for accepting €?
0 votes
1 answer
160
I solved both of these qs in a traditional way,by drawing nfa and then convert them to dfa..by tthis process ans shoulbe 4 and 2..but both of them are wrong..pls check..
0 votes
1 answer
162
3 votes
2 answers
164
What are the Number of states in minimum DFA that accepts Binary strings when interpreted as decimal mod 12 give 0 as remainder.Also give DFA.
21 votes
2 answers
165
Following is a state table for time finite state machine.$$\begin{array}{|l|ll|}\hline \textbf{Present State} & \textbf{Next State Output} \\ & \textbf{Input- 0} & \t...
2 votes
1 answer
166
2 votes
2 answers
168
If NFA has n states, then its DFA can have______states in worst case.
2 votes
2 answers
169
Let Σ= {a}, assume language, L= { a^(2012.K) / K 0}, what is minimum number of states needed in a DFA to recognize L
1 votes
1 answer
170
What are the number of final states in minimal DFA, where $\Sigma = \{a,b\}$, if every string starts with "aa" and length of string is not congruent to 0 mod 4?7635
4 votes
5 answers
171
The minimal state DFA, accepting all strings over the alphabet {0,1} where the nth symbol in every string from the right end is a 1, hasa) 2n states b) 2n-1 states c) 2n...
36 votes
6 answers
178
4 votes
3 answers
179
What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?A. 8B. 9C. 6D. None
30 votes
5 answers
180