turingMachine: An implementation of Turing Machine and Automaton

[ gpl, library, math ] [ Propose Tags ]

An implementation of Turing Machine and Automaton for language theory


[Skip to Readme]
Versions 0.1.1.2, 0.1.2.0, 0.1.3.0, 1.0.0.0
Dependencies base (>=4.6 && <5), containers (>=0.5.6.2), mtl (>=2 && <2.3) [details]
License GPL-3.0-only
Copyright (c) Jorge Santiago Alvarez Cuadros
Author Jorge Santiago Alvarez Cuadros
Maintainer sanjorgek@ciencias.unam.mx
Category Math
Home page https://github.com/sanjorgek/turingMachine
Bug tracker https://github.com/sanjorgek/turingMachine/issues
Source repo head: git clone git@github.com:sanjorgek/turingMachine.git
Uploaded by sanjorgek at Thu Feb 15 21:21:44 UTC 2018
Distributions NixOS:1.0.0.0
Downloads 595 total (10 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-02-15 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for turingMachine-1.0.0.0

[back to package description]

Turing Machine Model

An implementation of Turing Machine and Automaton for Language Theory

turingMachine Build Status Code Climate Issue Count CircleCI

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
    • [x] Delta
      • [x] Deterministic
      • [x] Non-deterministic
      • [x] Lift deltas
    • [x] Lambda
      • [x] Lambda1
      • [x] Lambda2
      • [x] Lift lambda
    • [ ] Recognizer
      • [x] Deterministic def
      • [x] Non-deterministic def
      • [x] Check Word
      • [ ] k-distinguishable states
      • [ ] Distinguishable states
      • [ ] Equivalent states
      • [x] Equivalent recognizer
      • [x] Non-deterministic to deterministic, and viceversa
      • [x] Recheable recognizer
      • [x] Distinguishable recognizer
      • [x] Minimize recognizer
      • [ ] Remove Ambiguity
      • [x] Language cadinality
    • [ ] Transductor
      • [x] Moore
      • [x] Mealy
      • [x] translate
      • [ ] Moore to Mealy, and viceversa
    • [ ] Recognizer with epsilon transitions
      • [ ] def
      • [ ] Recognizer with epsilon transitions to Recognizer without epsilon transitions
  • [ ] Stack Automaton
    • [x] Lift delta
    • [x] 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