Turing Machine (C++ Implementation)

• Web page
• http://alexvn.freeservers.com/s1/turing.html
• Downloads
• http://www.simtel.net/pub/pd/61179.html
• http://home.barak-online.net/alexvn/s2/tr/trmach10.zip
• Source
  • http://groups.google.com/groups?th=5f29a9fc083ee736
• Raw run log (demo)
  • http://groups.google.com/groups?th=7aa5bb6cfb62f89f

Introduction

The C++-program simulates a Turing Machine (TM).
TM is defined by input files: metafile, states file, alphabet file, transition file, input word(s) file(s):

1. Each row of metafile contains data related to some Turing machine (number of tapes, names of states file, alphabet file, transition file, input word(s) file(s)).
2. States file contains a list of initial, halting and internal states.
3. Alphabet contains a list of empty, input and internal symbols.
4. Each row of transition contains some transition rule.
5. Each row of input word(s) contains input word for some tape.

A Turing Machine example (Recognition of Palindromes) from 'The Design and Analysis of Computer Algorithms [1976]' by A.V.Aho, J.E.Hopcroft, J.D.Ullman (See examples 1.8, 1.9) is used as a demo sample of Turing Machine.