Skip to main content

Menu

Navigation

More options

Style variation

Contact us

Is the DFA Solution for Regular Expressions Accurate?

Topic: Comp Sci
Thread starter shivajikobardan
Start date Apr 16, 2022
Tags

Dfa Expression Regular

Join the discussion

Registration is free. Ask a follow-up in this thread, or start your own.

1 reply · 2K views · last reply Apr 21, 2022

shivajikobardan

Thread starter
Apr 16, 2022

#1

Homework Statement: NDFA for (ba)* U (bab)*. Convert this to DFA.

Relevant Equations: none

Handwritten state diagram of a DFA on lined paper with states q0 (accepting), q1, q2 (accepting) and q3; transitions labelled b from q0 to q1, a from q1 to q2, a from q2 to q3, b from q2 to q1 and b from q3 to q1.

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

State diagram of a DFA with start state, accepting states A, C, D, E, I and transitions labeled b, a, b from A through B and C to D, then branches on a to E and b to F, with loops E-b-G-a and F-a-H-b-I and I-b back to F.

I feel correct mine also, but not sure. Check it please.

Physics news on Phys.org

Discussion

Jarvis323

Apr 21, 2022

#2

Your DFA accepts is babba. But should it?

Top