turingMachine-0.1.3.0: An implementation of Turing Machine and Automaton

Copyright(c) Jorge Santiago Alvarez Cuadros, 2016
LicenseGPL-3
Maintainersanjorgek@ciencias.unam.mx
Stabilityexperimental
Portabilityportable
Safe HaskellSafe
LanguageHaskell2010
Extensions
  • MonoLocalBinds
  • TypeFamilies
  • TypeSynonymInstances
  • FlexibleInstances
  • MultiParamTypeClasses
  • KindSignatures
  • TypeOperators
  • ExplicitNamespaces

Math.Model.Turing.TwoWays

Description

Two ways turing machine

Synopsis

Documentation

data Tape a Source

Constructors

T [a] a [a] 

Instances

Functor Tape Source 
Applicative Tape Source 
Tapeable Tape Symbol Source
>>> let tapeLifted = (liftTape "word")::Tape Symbol
>>> tapeLifted
T "" 'w' "ord"
TuringM Tape Symbol LRS Source 
Tapeable Tape [Symbol] Source 
TuringM Tape [Symbol] LRS Source 
Eq a => Eq (Tape a) Source 
Show a => Show (Tape a) Source 
(Eq s, Monoid s) => Monoid (Tape s) Source