Skip to content

To do

Jump to bottom Edit New page
pbaeyens edited this page Jan 4, 2015 · 3 revisions

The following is a rough draft of the features we want to include in our program:

  • DFAs, NFAs, eNFAs
    • DFA
    • NFA
    • eNFA
    • Logging functions
  • Automata transformation
    • Powerset construction
    • Epsilon closure
    • DFA to NFA and eNFA
    • Union, intersection, difference and complement
    • Concatenation
    • Product
    • Reversal
    • Homomorpism (?)
  • Regular expressions
    • Parser
  • Regular expressions transformation
    • Regex to NFA
  • Automata reduction and equivalence
  • Regex reduction and equivalence
  • Turing Machines
  • Free-context grammars
  • Chomsky and Greibach normal forms
  • Pushdown automata
  • Grammar - pushdown transformation
Add a custom footer
Add a custom sidebar

Clone this wiki locally