Skip to content

Assignments for the course CSD303 Theory Of Computation

Notifications You must be signed in to change notification settings

PrasannaNatarajan/CSD303_TOC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

30 Commits
 
 
 
 
 
 

Repository files navigation

CSD303_TOC

Assignments for the course CSD303 : Theory Of Computation

Group Name: SPD

Gist:

Question1:

To compile the code:

javac StringMaching.java

To run the code:

java StringMaching -T <full text> -P <pattern>

Modules Completed:

  1. matcher : Checks whether the given string matches the Transition table
  2. computeTransitionFunction: Creates Transition table for a given pattern

Modules Incomplete:

  1. None

Question2:

To compile the code:

javac Fragment.java NFA.java State.java mainClass.java

To run the code:

java mainClass -r <regex> -s <inputString>

Modules Completed:

  1. State: Class that defines a state
  2. Fragment: Class that defines fragments of transition.
  3. NFA​: Class that creates NFA out of user input (regex)
  4. mainClass: Simulates the NFA created by the class above

Modules Incomplete:

  1. Have to used multithreading to simulate the NFA

Question3:

Embedded System Simulated: Vending Machine

To compile the code:

javac MealyMachine.java
javac MooreMachine.java

To run the code:

java MealyMachine
java MooreMachine

Modules Completed:

  1. MooreMachine: Creates and simulates a moore machine for the above embedded system.
  2. MealyMachine: Creates and simulates a mealy machine for the above embedded system.

Modules Incomplete:

  1. None

Group Members

  1. Bhishmaraj -bhi5hmaraj

  2. Prasanna Natarajan - PrasannaNatarajan

  3. Vedant Chakravarthy - vedantcj