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]

Modules

[Last Documentation]

  • Data
    • Data.Delta
    • Data.Sigma
    • Data.State
  • Math
    • Model
      • Automaton
        • Math.Model.Automaton.Finite
        • Math.Model.Automaton.Stack
      • Math.Model.Turing
        • Math.Model.Turing.TwoWays

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.1.2, 0.1.2.0, 0.1.3.0, 1.0.0.0
Dependencies base (>=4.8 && <4.9), containers (>=0.5.6.2) [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 2016-05-11T04:35:37Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2530 total (12 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-11-25 [all 2 reports]

Readme for turingMachine-0.1.2.0

[back to package description]

Turing Machine Model

An implementation of Turing Machine and Automaton for language theory

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