Idea - FICS

Automata Cracker

Team and Contact Details

Student Name School Degree Year Email
Obaid-Ur-Rahman SiddiquiFaculty of Information TechnologyUndergraduateFourth[email protected]
Alishba EhsanFaculty of Information TechnologyUndergraduateFourth[email protected]
Saleha TehreemFaculty of Information TechnologyUndergraduateFourth[email protected]
Muzammil AliFaculty of Information TechnologyUndergraduateFourth[email protected]

Inter School Idea ? No
Do you need expertises from another area: No
If Yes please provide details of expertises you need:

Idea Details

Idea Name: Automata Cracker
Slogan: Ready to Crack?
Supervisor Name: Syed Irtaza Muzaffar Shah
Supervisor Designation: Lecturer
Supervisor School: Other
Supervisor Department: Faculty of Information Technology
Contact number: 03368772768
Email ID: [email protected]
Abstract:
    The project is based upon the concepts of Theory of Automata (TOA) which includes formal languages, Deterministic Finite Automata (DFA), Non-Deterministic Finite Automata (NFA & NFA-NULL), their conversions, transition tables, regular expressions, their union, intersection, divisibility, and closure. We aim to develop a software (a Web application) that will perform the above-mentioned functions.
What is the unmet need in society that your idea will fulfill ?
    Students find the course Theory of Automata quite tough. Our application, Automata Cracker will help such students in making strings, DFA, NFA, NFA-Null, and much more. As far as we have explored other applications, none of them were as credible as our application will be. It will assist education.
Who needs it ? How many would benefit ?
   Every student of Computer Science requires this application because Theory of Automata is a core course and every student or teacher affiliated with this course can make use of Automata-Cracker.
How will the solution works
    the workflow is as follows: Regular Language -> Regular Expression -> Non-Deterministic Finite Automata NULL -> Non-Deterministic Finite Automata -> Deterministic Finite Automata -> String Testing. The conversions use Thompsons Construction Algorithm , Null Closure Elimination , State Merging algorithm to make Finite Automata from Regular Languages or Regular Expressions.
Who are your competitors ? How is your solution different
    Automataker , FSM Simulator, RegEx generator are some of the competitors but none of them provide solutions which are all in one applications. every one of them lacks some functionalities The edge we have over our competitors is that we have every functionality provided all under one roof.
Status: new
Entry Date & Time: 2022-12-30 (1354)