RegExamaton
Competitive Programming
Mentors :
Hrishikesh Jedhe Deshmukh
Ayush Agarwal (210050029)
Mentees :
5-6
Our project is all about converting Regular Expressions to Deterministic Finite Automatas. Regular Expressions let you define complex patterns that can find, replace, or match any text you need. With just a few characters, you can unlock a world of possibilities. Automatas are powerful tools in computer science and mathematics, used to model and analyze processes that follow a strict sequence of steps. Ever heard of Turing Machine?! Most general and powerful automata is the Turing Machine. We will be looking at a specific class of automatas called Deterministic Finite Automatas(DFAs). Some popular uses of DFAs are in compiler design and formal verification.
To know more about RegEx and Automata: https://www.javatpoint.com/automata-regular-expression
Prerequisites : Familarity in C++
Tentative Timeline :
| Week | Work |
|---|---|
| Week 1 | Getting up to pace with C++, Graph Structures, String Parsing |
| Week 2-3 | Basics of Automata Theory and Regular Expressions |
| Week 4 | Implementing simple Deterministic Finite Automatas |
| Week 5-6 | Moving on to complex regular expressions, Combining simple automatas |
| Week 7 | Union, Intersection and Complementation of Languages |
| Week 8 | Documenting the project |
