Skip to content

Latest commit

 

History

History
18 lines (12 loc) · 533 Bytes

README.md

File metadata and controls

18 lines (12 loc) · 533 Bytes

Formal Language and Automata Theory Project

In this project, we developed a web-Apllication for converting non-deterministic finite automatas (NFAs) into its equivalent deterministic finite automata(DFA).

How to use

  • Just open the Web App with link given and you are good to go with the instructions.

    References

  • Attached Paper on Conversion of NFA to DFA.
  • Visualization Credits Viz.js library.