Register

Consider the regular expression 1(1+0)*0.

390 views
0 votes
0 votes
Consider the regular expression 1(1+0)*0.

Contruct the NFA for the given regular expression using Thomson’s construction algorithm and then apply subset construction algorithm to construct the equivalent DFA of the constructed NFA.Finally minimize the DFA.

Please answer with working:)
User Avatar

Please log in or register to answer this question.

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

Related questions

7 votes
7 votes
2 answers
4
im.raj asked Jun 16, 2016
34,787 views
Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is
A. (1 + 010)* B. (01 + 10)* C. (1 + 010)* (0 + λ) D. (1 + 01)* (0 + λ)
A. (1 + 010)*B. (01 + 10)*C. (1 + 010)* (0 + λ)D. (1 + 01)* (0 + λ)
User Avatar
Link Copied!