turingMachine: An implementation of Turing Machine and Automaton
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- Exposed modules use unallocated top-level names: Math
# 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
[Skip to Readme]
Properties
| Versions | 0.1.1.1, 0.1.1.2, 0.1.2.0, 0.1.3.0, 1.0.0.0 |
|---|---|
| Change log | None available |
| 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-11T03:58:44Z |
Modules
[Index]
Downloads
- turingMachine-0.1.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees