Register

#self_doubt #DFA

• retagged by
370 views
0 votes
0 votes

Regular Expression for accepting the language L = { 0^n1^m | n+m=even }

I got this solution – (00)*(11)*+0(00)*1(11)*

please point out how this – {(00)* (01)* (11)* }  RE differs from the above one

• retagged by
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

0 votes
0 votes
1 answer
1
aditykansara asked Jun 23, 2018
521 views
#DFA #TOC #theoryofcomputation
How to construct an automata with even number of a's OR odd number of b's?
How to construct an automata with even number of a's OR odd number of b's?
User Avatar
3 votes
3 votes
1 answer
2
Deepthi_ts asked Apr 17, 2017
4,191 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
2 votes
2 votes
1 answer
4
papesh asked Aug 13, 2016
1,147 views
#dfa
Symbols are a and b Fund DFA where... (N(a) - N(b)) mod 3 > 1
Symbols are a and bFund DFA where...(N(a) - N(b)) mod 3 1
User Avatar
Link Copied!