{"id":25439460,"url":"https://github.com/brthor/universal-finite-state-automaton","last_synced_at":"2025-06-11T00:34:17.443Z","repository":{"id":22012579,"uuid":"25338187","full_name":"brthor/Universal-Finite-State-Automaton","owner":"brthor","description":"C++ Program for interpreting any finite state automata and determining if certain strings exist in the language defined. Supports non-deterministic FSA's without empty moves as well.","archived":false,"fork":false,"pushed_at":"2014-10-17T04:30:55.000Z","size":132,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-05-15T09:43:26.704Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/brthor.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-10-17T04:27:03.000Z","updated_at":"2017-02-21T22:26:12.000Z","dependencies_parsed_at":"2022-08-05T15:19:02.198Z","dependency_job_id":null,"html_url":"https://github.com/brthor/Universal-Finite-State-Automaton","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/brthor%2FUniversal-Finite-State-Automaton","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brthor%2FUniversal-Finite-State-Automaton/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brthor%2FUniversal-Finite-State-Automaton/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brthor%2FUniversal-Finite-State-Automaton/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/brthor","download_url":"https://codeload.github.com/brthor/Universal-Finite-State-Automaton/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brthor%2FUniversal-Finite-State-Automaton/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259176114,"owners_count":22817120,"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":[],"created_at":"2025-02-17T10:19:33.594Z","updated_at":"2025-06-11T00:34:17.408Z","avatar_url":"https://github.com/brthor.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"Universal-Finite-State-Automaton\n================================\n\nC++ Program for interpreting any finite state automata and determining if certain strings exist in the language defined. Supports non-deterministic FSA's without empty moves as well.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbrthor%2Funiversal-finite-state-automaton","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbrthor%2Funiversal-finite-state-automaton","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbrthor%2Funiversal-finite-state-automaton/lists"}