372 views
0 votes
0 votes
Given language L = (0+1)*0^n, define a DFA with as few states as possible with n > 0.

1 Answer

–1 votes
–1 votes
State = 1

(0+1)*0* = (0+1)* so minimizedDFA has 1 state

Related questions

0 votes
0 votes
0 answers
1
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...
2 votes
2 votes
2 answers
3
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
1 answer
4
M_Umair_Khan42900 asked Dec 29, 2022
754 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...