Skip to content

danielsoutar/turing

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation


|_ | _ __ ___ | | _ __ _ _ ___ | |_ () ___ _ __ ___ | | | ' \ / | | | | '| | | | | / | | | | | / _ \ | ' \ / | | | | | | | _ \ | | | | | |_| | | ( | |_ | | | () | | | | | _
|
| || || |/ _| || _,| ___| _| || ___/ || || |__/ ############################################################################################

  1. cd [File path to turing folder here...]

  2. javac *.java

  3. java runtm

e.g: java runtm Turing.txt input.txt

Notes:

  • ’Interactive’ mode prints out the Machine’s traversal of the input, as well as the current transition. This is useful for both debugging the program and testing machine descriptions.
  • To use this mode, append the “-I” flag.

  • e.g: java runtm Turing.txt input.txt -I

  • ’Performance’ mode prints out the number of steps that the Machine makes in order to evaluate the input. For example, suppose the string ‘abcabcbacba’ (which is palindromic) was passed to the palindrome description (‘palindrome.txt’) attached. Then the machine would take 47 steps to traverse the input and accept it. You can confirm this for yourself, if you like.
  • To use this mode, append the “-P” flag.

  • e.g: java runtm palindrome.txt input.txt -P

  • You can use both flags together, and in any order (although they must come at the end).
  • e.g: java runtm palindrome.txt input.txt -I -P

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages