Assignments for the course CSD303 : Theory Of Computation
To compile the code:
javac StringMaching.javaTo run the code:
java StringMaching -T <full text> -P <pattern>- matcher : Checks whether the given string matches the Transition table
 - computeTransitionFunction: Creates Transition table for a given pattern
 
- None
 
To compile the code:
javac Fragment.java NFA.java State.java mainClass.javaTo run the code:
java mainClass -r <regex> -s <inputString>- State: Class that defines a state
 - Fragment: Class that defines fragments of transition.
 - NFA: Class that creates NFA out of user input (regex)
 - mainClass: Simulates the NFA created by the class above
 
- Have to used multithreading to simulate the NFA
 
To compile the code:
javac MealyMachine.java
javac MooreMachine.javaTo run the code:
java MealyMachine
java MooreMachine- MooreMachine: Creates and simulates a moore machine for the above embedded system.
 - MealyMachine: Creates and simulates a mealy machine for the above embedded system.
 
- None
 
- 
Bhishmaraj -bhi5hmaraj
 - 
Prasanna Natarajan - PrasannaNatarajan
 - 
Vedant Chakravarthy - vedantcj