Repository files navigation

A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) andregular expressions.

This project is a tool designed to help studentssolve understand quizzesand assignments from the courseTMV028/DIT322 atCTH. But can be used by anyone with an interest in automatas.

Contributions are welcome! If you found a bug please report an issue on GitHubor fix it yourself. New features are also welcome.

Current features and some features thatmight be added in the future.

• DFA
• NFA
• ε-NFA
• String tests
  • Web App
• Subset Construction
  • Web App
• Product Construction
  • Web App
• Sum Construction
  • Web App
• Convert to Regular Expression
  • Web App
• Equality
  • Web App
• Minimisation
  • Web App
• Parsing file formats
  • ASCII table (TMV028/DIT322 specific format)
  • .jff fromJFLAP
• Formatting file formats
  • ASCII table (TMV028/DIT322 specific format)
  • LaTeX tables
  • .jff fromJFLAP

• String tests
  • Web App
• Simplification (Can always be improved)
  • Web App
• Convert to Automata
  • Web App

• Parsing strings
  • Constructing parse trees
    • Web App
  • Constructing CYK tables
    • Web App
• Transformations
  • Bin
    • Web App
  • Del
    • Web App
  • Unit
    • Web App
  • Term
    • Web App
  • Chomsky Normal Form
    • Web App
• Parsing file formats
  • UTF8
  • .jff fromJFLAP
• Formatting file formats
  • LaTeX
  • UTF8
  • .jff fromJFLAP

This project can also be used as anpm library for JavaScript or TypeScript.It does not exist on thenpm repository, but you can add it to your projectfrom GitHub with the following command:

npm install 89netraM/auto-automata