{"id":19146486,"url":"https://github.com/kahsolt/turingmachine","last_synced_at":"2026-06-04T16:31:07.076Z","repository":{"id":113306702,"uuid":"220575673","full_name":"Kahsolt/TuringMachine","owner":"Kahsolt","description":"Stanard one-bidirectional-infinite-tape Turing Machine simulation","archived":false,"fork":false,"pushed_at":"2019-12-30T15:48:28.000Z","size":4203,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-03T16:28:48.377Z","etag":null,"topics":["automata","computational-science","homework-project","simulator","turingmachine"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"wtfpl","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Kahsolt.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-11-09T01:43:37.000Z","updated_at":"2019-12-30T15:48:30.000Z","dependencies_parsed_at":null,"dependency_job_id":"8979171c-1484-42fc-873b-2b605bde3bf3","html_url":"https://github.com/Kahsolt/TuringMachine","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kahsolt%2FTuringMachine","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kahsolt%2FTuringMachine/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kahsolt%2FTuringMachine/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kahsolt%2FTuringMachine/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Kahsolt","download_url":"https://codeload.github.com/Kahsolt/TuringMachine/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240229935,"owners_count":19768588,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["automata","computational-science","homework-project","simulator","turingmachine"],"created_at":"2024-11-09T07:44:19.486Z","updated_at":"2026-06-04T16:31:07.069Z","avatar_url":"https://github.com/Kahsolt.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# TuringMachine\r\n\r\n    Standard k-tape Turing Machine simulator\r\n    homework project of NJU course 'Preliminary Introduction to the Theory of Computation'\r\n\r\n----\r\n\r\nThe problem description is here: [TM-Problem.pdf](/TM-Problem.pdf)\r\n\r\nDetailed solution report is here: [TM.md](/TM.md)\r\n\r\n## Quickstart\r\n\r\n  - have a look at [config.h](/src/config.h) for customization, and [/Makefile](Makefile) if you wanna modify executable filename, then do `make`\r\n  - run demos, e.g. `make test CASE=programs/palindrome`, or rudely `make test_all`\r\n  - create a directory for your case, containing:\r\n    - a TM description filenamed `test.tm` (referring to [syntax.tm](/programs/syntax.tm) and [example programs](/programs))\r\n    - your test inputs in **one line** filenamed `input.txt`\r\n  - run `make run CASE=\u003ccase-directory-path\u003e` to start your TM on given input, you should now see:\r\n    - console logs\r\n    - log file `console.txt` and `results.txt` generated under your case-directory\r\n\r\n### Example Programs\r\n\r\n  - [incr](/programs/incr/test.tm): increase a binary number by 1, minimal example for 1-tape TM syntax demo\r\n  - [add_3](/programs/add_3/test.tm): add up two binary numbers, minimal example for multi-tape TM syntax demo\r\n  - [reverse](/programs/reverse/test.tm): reverse a binary string\r\n  - [reverse_2](/programs/reverse_2/test.tm): reverse, on 2-tape TM\r\n  \r\n  - [palindrome](/programs/palindrome/test.tm): decide a palindrome binary string\r\n  - [palindrome_2](/programs/palindrome_2/test.tm): decide palindrome, on 2-tape TM\r\n  - [mult](/programs/mult/test.tm): decide a unary multiply equation string\r\n  - [fib_4](/programs/fib_4/test.tm): decide a unary string in fibonacci number length, on 4-tape TM\r\n  - [ww](/programs/ww/test.tm): decide a binary string in form of 'ww'\r\n\r\n----\r\n\r\nby Armit\r\n2019/10/02 \r\n2019-11-26","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkahsolt%2Fturingmachine","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkahsolt%2Fturingmachine","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkahsolt%2Fturingmachine/lists"}