Comp Sci Is the DFA Solution for Regular Expressions Accurate?

shivajikobardan
Messages
637
Reaction score
54
Homework Statement
NDFA for (ba)* U (bab)*. Convert this to DFA.
Relevant Equations
none
1650118147393.png


but the solution site says otherwise-:
https://cyberzhg.github.io/toolbox/nfa2dfa

1650118207232.png

I feel correct mine also, but not sure. Check it please.
 
Physics news on Phys.org
Your DFA accepts is babba. But should it?
 

Similar threads

Comp Sci DFA that accepts either ab or ba as substring?
Replies
1
Views
6K
Constructing a DFA from a Regular Expression: How to Handle * and () Operators?
Replies
2
Views
2K
Comp Sci Regular Expression in Theory of Automata and Computation
Replies
5
Views
1K
Comp Sci IEEE-754 Precision Format
Replies
17
Views
3K
MHB Designing NFA & DFA for (1001 + 110 + 11)* Language
Replies
6
Views
4K
What is [50-99] in regular expression?
Replies
4
Views
2K
Comp Sci Regular expression to NFA -- confusing regular expressions-:
Replies
1
Views
1K
Which Comp Sci Degree Should I Choose for Better Earnings?
Replies
3
Views
2K
Comp Sci Validating Braces Placement for Expression Evaluation
Replies
10
Views
2K
Admissions Is it realistic to go from an undeclared major to a comp sci major?
Replies
20
Views
3K

Hot Threads

Recent Insights

Back
Top