This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/******************************************************** | |
Author - Arsharaj Chauhan | |
Github Profile - arsharaj | |
Program to convert a regular expression into a nfa (Non-Deterministic Finite Automata). | |
Supported Symbols - { '+' , '|' , '*' } | |
------------ Test Case 1 ------------------ | |
Enter the regular expression without brackets : a+baba*b* | |
No of states : 10 |