CS112 projects -- Automata Theory and Formal Languages Projects

Content

• Deterministic finite automaton
  • DFA input file validation
  • DFA word acceptance
• Nondeterministic finite automaton
  • NFA & ε-NFA input file validation
  • NFA & ε-NFA word acceptance
  • NFA to DFA conversion
• DFA Minimization
  • Myhill-Nerode theorem
  • Dead states elimination
• Context-Free Grammar
  • CFG input file validation
• Turing Machine
  • TM input file validation
  • TM word acceptance

PROJECT 1 (DFA validation & acceptance)

PROJECT 2 (NFA and ε-NFA validation & acceptance + NFA to DFA conversion)

PROJECT 3 (DFA Minimization)

language for PROJECT 1, PROJECT 2, PROJECT 3 : c++

Project 4 OLX Crawler

Project 5 (CFG)

Project 6 (Turing Machine)

language for PROJECT 5, PROJECT 6 : python