Register

#DFA #TOC #theoryofcomputation

522 views

1 Answer

Best answer
0 votes
0 votes

There are 4 possibilities, with each possibility being a state

1) Even 'a' and Even 'b'   --> q0

2) Odd 'a' and Even 'b'   --> q1

3) Even 'a' and Odd 'b'   --> q2

4) Odd 'a' and Odd 'b'   --> q3

Since its an OR condition, any state other than q1 is a final state

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

Related questions

3 votes
3 votes
1 answer
2
Deepthi_ts asked Apr 17, 2017
4,204 views
#theory of computation #DFA #NFA
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are: A NFA – 3, DFA – 4 B NFA – 3, DFA – 3 C NFA – 3, DFA – 3 D NFA – 4, DFA – 4
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:ANFA – 3, DFA – 4BNFA – 3, DFA – 3...
User Avatar
0 votes
0 votes
1 answer
4
Srken asked Sep 4, 2022
321 views
#Toc #regularexpression
How to convert (a+b)* into a minimal Dfa
How to convert (a+b)* into a minimal Dfa
User Avatar
Link Copied!