@hackage / turingMachine

Turing Machine Model

An implementation of Turing Machine and Automaton for Language Theory

Math Models

Finite Automaton

Finite State machine, with no memory. Exist:

1. Recognizer
2. Generator
3. Transducer

Stack Automaton

Stack memory machine with states

Turing Machine

To Do

• Finite Automaton
  • Delta
    • Deterministic
    • Non-deterministic
    • Lift deltas
  • Lambda
    • Lambda1
    • Lambda2
    • Lift lambda
  • Recognizer
    • Deterministic def
    • Non-deterministic def
    • Check Word
    • k-distinguishable states
    • Distinguishable states
    • Equivalent states
    • Equivalent recognizer
    • Non-deterministic to deterministic, and viceversa
    • Recheable recognizer
    • Distinguishable recognizer
    • Minimize recognizer
    • Remove Ambiguity
    • Language cadinality
  • Transductor
    • Moore
    • Mealy
    • translate
    • Moore to Mealy, and viceversa
  • Recognizer with epsilon transitions
    • def
    • Recognizer with epsilon transitions to Recognizer without epsilon transitions
• Stack Automaton
  • Lift delta
  • Deterministic stack automaton def
  • Non-deterministic stack automaton def
  • Non-deterministic to deterministic stack automaton
  • Recognizer with epsilon transitions
• Turing Machine
  • Class def
  • Tape def
  • Delta def
  • Accept word