{"id":29957324,"url":"https://github.com/mirkoalicastro/turing","last_synced_at":"2025-08-03T19:31:37.683Z","repository":{"id":307913627,"uuid":"126391139","full_name":"mirkoalicastro/turing","owner":"mirkoalicastro","description":"A Non-Deterministic Multi-Tape Turing machine simulator","archived":false,"fork":false,"pushed_at":"2021-05-07T22:00:43.000Z","size":20,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-08-03T01:20:17.440Z","etag":null,"topics":["non-deterministic-turing-machine","turing-machine-simulator"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mirkoalicastro.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,"zenodo":null}},"created_at":"2018-03-22T20:25:27.000Z","updated_at":"2021-09-19T17:50:39.000Z","dependencies_parsed_at":"2025-08-03T01:20:19.427Z","dependency_job_id":"a0f70748-835d-4672-bf23-746d00af5dbb","html_url":"https://github.com/mirkoalicastro/turing","commit_stats":null,"previous_names":["mirkoalicastro/turing"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/mirkoalicastro/turing","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mirkoalicastro%2Fturing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mirkoalicastro%2Fturing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mirkoalicastro%2Fturing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mirkoalicastro%2Fturing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mirkoalicastro","download_url":"https://codeload.github.com/mirkoalicastro/turing/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mirkoalicastro%2Fturing/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":268600953,"owners_count":24276661,"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","status":"online","status_checked_at":"2025-08-03T02:00:12.545Z","response_time":2577,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["non-deterministic-turing-machine","turing-machine-simulator"],"created_at":"2025-08-03T19:30:43.543Z","updated_at":"2025-08-03T19:31:37.669Z","avatar_url":"https://github.com/mirkoalicastro.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1\u003e\u003ca id=\"Turing_0\"\u003e\u003c/a\u003eTuring\u003c/h1\u003e\r\n\u003cblockquote\u003e\r\n\u003cp\u003eA Non-Deterministic Multi-Tape Turing\u003cbr\u003e\r\nmachine is like a Turing machine but it\u003cbr\u003e\r\nhas several tapes and its set of rules\u003cbr\u003e\r\nmay prescribe more than one action to\u003cbr\u003e\r\nbe performed for any given situation.\u003c/p\u003e\r\n\u003c/blockquote\u003e\r\n\u003ch3\u003e\u003ca id=\"What_is_it_7\"\u003e\u003c/a\u003eWhat is it?\u003c/h3\u003e\r\n\u003cp\u003eIt’s just another Turing machine simulator. It can handle non-deterministic events and there is no limit to tapes number.\u003c/p\u003e\r\n\u003ch3\u003e\u003ca id=\"Development_10\"\u003e\u003c/a\u003eDevelopment\u003c/h3\u003e\r\n\u003cp\u003eIt could be a good starting point for a more complete and complex Turing machine simulator.\u003c/p\u003e\r\n\u003cp\u003eIf you find a bug or just want to contribute to the project, feel free to do it.\u003c/p\u003e\r\n\u003ch3\u003e\u003ca id=\"Syntax_15\"\u003e\u003c/a\u003eSyntax\u003c/h3\u003e\r\n\u003cp\u003eThe first line of the program file must be the input (without starting symbol).\u003cbr\u003e\r\nThen, each line consists of:\u003c/p\u003e\r\n\u003cpre\u003e\u003ccode\u003estate; configuration; relation\r\n\u003c/code\u003e\u003c/pre\u003e\r\n\u003cp\u003eWhere,\u003c/p\u003e\r\n\u003cul\u003e\r\n\u003cli\u003e\u003cstrong\u003estate\u003c/strong\u003e is a string which represents the name of the state;\u003c/li\u003e\r\n\u003cli\u003e\u003cstrong\u003econfiguration\u003c/strong\u003e is a sequence enclosed between two brackets where each elements is separated by a comma. The i-th element represents the character on the i-th tape;\u003c/li\u003e\r\n\u003cli\u003e\u003cstrong\u003erelation\u003c/strong\u003e is a relation (not necessarily a function). It is represented by a sequence enclosed between two brackets where each elements is separated by a comma. The first element is the \u003cem\u003estate\u003c/em\u003e where the Turing machine will go if it is in the state \u003cem\u003estate\u003c/em\u003e and has the configuration \u003cem\u003econfiguration\u003c/em\u003e. Then, there are a two elements of each tape. The first one, for each tape, represents the character which will be written by the head of this tape. The second one, for each tape, represents the direction where the head of this tape will go, in particular:\r\n\u003cul\u003e\r\n\u003cli\u003e\u003cstrong\u003eR\u003c/strong\u003e for right;\u003c/li\u003e\r\n\u003cli\u003e\u003cstrong\u003eL\u003c/strong\u003e for left;\u003c/li\u003e\r\n\u003cli\u003e\u003cstrong\u003e-\u003c/strong\u003e don’t move;\u003c/li\u003e\r\n\u003c/ul\u003e\r\n\u003c/li\u003e\r\n\u003c/ul\u003e\r\n\u003ch4\u003e\u003ca id=\"Reserved_Character_29\"\u003e\u003c/a\u003eReserved Characters\u003c/h4\u003e\r\n\u003ctable class=\"table table-striped table-bordered\"\u003e\r\n\u003cthead\u003e\r\n\u003ctr\u003e\r\n\u003cth\u003eChar\u003c/th\u003e\r\n\u003cth\u003eMeaning\u003c/th\u003e\r\n\u003c/tr\u003e\r\n\u003c/thead\u003e\r\n\u003ctbody\u003e\r\n\u003ctr\u003e\r\n\u003ctd\u003e\u0026gt;\u003c/td\u003e\r\n\u003ctd\u003eStarting symbol\u003c/td\u003e\r\n\u003c/tr\u003e\r\n\u003ctr\u003e\r\n\u003ctd\u003e_\u003c/td\u003e\r\n\u003ctd\u003eBlank symbol\u003c/td\u003e\r\n\u003c/tr\u003e\r\n\u003ctr\u003e\r\n\u003ctd\u003es\u003c/td\u003e\r\n\u003ctd\u003eInitial state\u003c/td\u003e\r\n\u003c/tr\u003e\r\n\u003ctr\u003e\r\n\u003ctd\u003eH\u003c/td\u003e\r\n\u003ctd\u003eHalt: final state\u003c/td\u003e\r\n\u003c/tr\u003e\r\n\u003ctr\u003e\r\n\u003ctd\u003eY\u003c/td\u003e\r\n\u003ctd\u003eYes: final state\u003c/td\u003e\r\n\u003c/tr\u003e\r\n\u003ctr\u003e\r\n\u003ctd\u003eN\u003c/td\u003e\r\n\u003ctd\u003eNo: final state\u003c/td\u003e\r\n\u003c/tr\u003e\r\n\u003c/tbody\u003e\r\n\u003c/table\u003e\r\n\u003ch4\u003e\u003ca id=\"An_example_39\"\u003e\u003c/a\u003eAn example\u003c/h4\u003e\r\n\u003cp\u003eCheck if a binary string is \u003cu\u003enot\u003c/u\u003e a palindrome one.\u003c/p\u003e\r\n\u003cpre\u003e\u003ccode\u003e001100\r\ns; (\u0026gt;, \u0026gt;); (s, \u0026gt;, R, \u0026gt;, R)\r\ns; (1, _); (s, 1, R, _, -)\r\ns; (1, _); (s, 1, R, 1, R)\r\ns; (0, _); (s, 0, R, _, -)\r\ns; (0, _); (s, 0, R, 1, R)\r\ns; (_, _); (b, _, L, _, L)\r\nb; (1,1); (b, 1, L, 1, L)\r\nb; (0,1); (b, 0, L, 1, L)\r\nb; (1, \u0026gt;); (z1, 1, L, \u0026gt;, R)\r\nb; (0, \u0026gt;); (z0, 0, L, \u0026gt;, R)\r\nb; (\u0026gt;, \u0026gt;); (N, \u0026gt;, R, \u0026gt;, R)\r\nz0; (1, 1); (z0, 1, L, 1, -)\r\nz0; (0, 1); (z0, 0, L, 1, -)\r\nz0; (\u0026gt;, 1); (q0, \u0026gt;, R, 1, -)\r\nz0; (1, _); (z0, 1, L, _, -)\r\nz0; (0, _); (z0, 0, L, _, -)\r\nz0; (\u0026gt;, _); (q0, \u0026gt;, R, _, -)\r\nz1; (1, 1); (z1, 1, L, 1, -)\r\nz1; (0, 1); (z1, 0, L, 1, -)\r\nz1; (\u0026gt;, 1); (q1, \u0026gt;, R, 1, -)\r\nz1; (1, _); (z1, 1, L, _, -)\r\nz1; (0, _); (z1, 0, L, _, -)\r\nz1; (\u0026gt;, _); (q1, \u0026gt;, R, _, -)\r\nq0; (1,1); (q0, 1, R, 1, R)\r\nq0; (0,1); (q0, 0, R, 1, R)\r\nq1; (1,1); (q1, 1, R, 1, R)\r\nq1; (0,1); (q1, 0, R, 1, R)\r\nq1; (1, _); (N, 1, -, _, -)\r\nq1; (0, _); (Y, 0, -, _, -)\r\nq0; (0, _); (N, 0, -, _, -)\r\nq0; (1, _); (Y, 1, -, _, -)\r\n\u003c/code\u003e\u003c/pre\u003e\r\n\u003ch2\u003e\u003ca id=\"License_71\"\u003e\u003c/a\u003eLicense\u003c/h2\u003e\r\n\u003cp\u003eMIT\u003c/p\u003e\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmirkoalicastro%2Fturing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmirkoalicastro%2Fturing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmirkoalicastro%2Fturing/lists"}