{"id":16380142,"url":"https://github.com/felixklauke/winchester","last_synced_at":"2026-04-23T08:30:18.914Z","repository":{"id":87095502,"uuid":"122187720","full_name":"felixklauke/winchester","owner":"felixklauke","description":"Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.","archived":false,"fork":false,"pushed_at":"2018-03-15T06:45:51.000Z","size":47,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"dev","last_synced_at":"2025-01-01T20:45:13.768Z","etag":null,"topics":["deterministic","deterministic-finite-automata","dfa","dfa-construction","dfa-minimization","state-machine"],"latest_commit_sha":null,"homepage":"http://felix-klauke.de","language":"C++","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/felixklauke.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","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":"2018-02-20T11:07:42.000Z","updated_at":"2022-07-07T12:26:03.000Z","dependencies_parsed_at":null,"dependency_job_id":"7ccfe37e-f444-4cb3-a51c-5f9380f5a406","html_url":"https://github.com/felixklauke/winchester","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/felixklauke%2Fwinchester","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/felixklauke%2Fwinchester/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/felixklauke%2Fwinchester/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/felixklauke%2Fwinchester/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/felixklauke","download_url":"https://codeload.github.com/felixklauke/winchester/tar.gz/refs/heads/dev","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240035705,"owners_count":19737602,"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":["deterministic","deterministic-finite-automata","dfa","dfa-construction","dfa-minimization","state-machine"],"created_at":"2024-10-11T03:50:32.577Z","updated_at":"2026-04-23T08:30:18.862Z","avatar_url":"https://github.com/felixklauke.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# winchester\nFast and effective finite automaton software that can simulate acceptance tests in a state machine style.\n\n# Example\n_Creation and simple word test:_\n```cpp\nauto states = std::set\u003cState\u003e();\nauto startState = State(0, \"q0\", false);\nauto secondState = State(1, \"q1\", false);\nauto thirdState = State(2, \"q2\", true);\n\nstates.insert(startState);\nstates.insert(secondState);\nstates.insert(thirdState);\n\nauto alphabet = std::set\u003cchar\u003e();\nalphabet.insert('a');\nalphabet.insert('b');\nalphabet.insert('c');\n\nauto transitions = std::map\u003cState, std::set\u003cTransition\u003e\u003e();\n\nauto dfa = DFA(states, alphabet, transitions, startState);\ndfa.AddTransition(startState, Transition('a', secondState));\ndfa.AddTransition(startState, Transition('b', startState));\ndfa.AddTransition(startState, Transition('c', startState));\n\ndfa.AddTransition(secondState, Transition('a', secondState));\ndfa.AddTransition(secondState, Transition('b', thirdState));\ndfa.AddTransition(secondState, Transition('c', startState));\n\ndfa.AddTransition(thirdState, Transition('a', thirdState));\ndfa.AddTransition(thirdState, Transition('b', thirdState));\ndfa.AddTransition(thirdState, Transition('c', thirdState));\n\nauto accepted = dfa.ProcessInput(\"abaaaacab\");\nstd::cout \u003c\u003c \"Accepted: \" \u003c\u003c accepted \u003c\u003c std::endl;\n```\n\n_Create the complement (Accepts all words the former language didn't accept and vice versa):_\n```cpp\nauto complement = dfa.BuildComplement();\n```\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffelixklauke%2Fwinchester","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffelixklauke%2Fwinchester","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffelixklauke%2Fwinchester/lists"}