Is the DFA Solution for Regular Expressions Accurate?

  • Context: Comp Sci 
  • Thread starter Thread starter shivajikobardan
  • Start date Start date
  • Tags Tags
    Dfa Expression Regular
Click For Summary
SUMMARY

The discussion centers around the accuracy of the Deterministic Finite Automaton (DFA) solution for regular expressions, specifically referencing a tool available at https://cyberzhg.github.io/toolbox/nfa2dfa. Participants express uncertainty regarding the DFA's acceptance of the string "babba," questioning whether it should be accepted based on the provided solution. The conversation highlights the need for verification of DFA outputs against expected results to ensure correctness in regular expression implementations.

PREREQUISITES
  • Understanding of Deterministic Finite Automata (DFA)
  • Familiarity with regular expressions and their syntax
  • Knowledge of Non-deterministic Finite Automata (NFA)
  • Basic programming skills to utilize DFA conversion tools
NEXT STEPS
  • Research the principles of DFA and NFA conversion algorithms
  • Explore the implementation of regular expressions in programming languages like Python or Java
  • Learn how to validate DFA outputs against expected string acceptance
  • Investigate common pitfalls in DFA construction and testing
USEFUL FOR

Computer science students, software developers, and anyone involved in automata theory or regular expression implementation will benefit from this discussion.

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