Turing Machine (C++ Implementation)

C++ Implementation of a Turing Machine can be seen at :


--------- Web Page ---------
http://alexvn.freeservers.com/s1/turing.html


--------- Download ---------
http://www.simtel.net/pub/pd/61179.html
http://home.barak-online.net/alexvn/s2/tr/trmach10.zip
http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=5140&lngWId=3


--------- Sources ---------
http://groups.google.com/groups?th=5f29a9fc083ee736


--------- Run Log (Demo) ---------
http://groups.google.com/groups?th=7aa5bb6cfb62f89f




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 list of initial, halting and internal states.
3) Alphabet contains 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.


    ==============================
      Alex Vinokur
          mailto:alexvn@go.to
          http://www.simtel.net/pub/oth/19088.html

Return to the comp.compilers page.
Search the comp.compilers archives again.