Register

DFA accepting (0+1)*01(0+1)*01(0+1)*

1,640 views

1 Answer

1 votes
1 votes

Ans is A.

Consider the string 011010.

  • Option A reach final state (accept)
  • Option B and C are not DFA, they have non deterministic transitions
  • Option D cannot accept this string
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
KingSAJ asked Jan 19, 2015
818 views
The number of states in a DFA accepting all the strings over {0,1} in which 5th symbol from right hand side is always '1' is?
Will the answer be $4$ or $2^5$?
User Avatar
0 votes
0 votes
0 answers
3
Anuanu asked Jun 24, 2016
419 views
how many states are there in a minimum state deterministic finite automaton accepting language l ={ w| w e(0,1)*
User Avatar
0 votes
0 votes
1 answer
4
M_Umair_Khan42900 asked Dec 29, 2022
787 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)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
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)...
User Avatar
Link Copied!