Register

construct of Deterministic Finite Automata (DFA) from following regular expression (0+1)*(00+11) (0+1)*

Redirected
20,379 views

3 Answers

6 votes
6 votes

Construct A Finite Automata(NFA) first:

Now, convert above NFA to DFA

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
804 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
0 votes
0 votes
0 answers
3
sumit goyal 1 asked Dec 30, 2017
243 views
doubt in taking common when forming Regular expression from finite automata
Tick is correct answer but how do we know which way to take common because it affect the language , is regular expression written in red is correct ?
Tick is correct answer but how do we know which way to take common because it affect the language , is regular expression written in red is correct ?
User Avatar
Link Copied!