{"id":16674634,"url":"https://github.com/mateusjunges/afd","last_synced_at":"2026-05-17T23:32:18.954Z","repository":{"id":98722475,"uuid":"209677285","full_name":"mateusjunges/afd","owner":"mateusjunges","description":"Implementation of and AFD (Deterministic Finit Automaton) for the Formal Languages and Compilers grade - Computer Engineering @ UEPG","archived":false,"fork":false,"pushed_at":"2019-09-21T20:16:29.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-31T14:45:10.521Z","etag":null,"topics":["afd","automaton","compilers","formal-languages","python"],"latest_commit_sha":null,"homepage":null,"language":"Python","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/mateusjunges.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-09-20T01:13:42.000Z","updated_at":"2020-05-23T08:28:55.000Z","dependencies_parsed_at":null,"dependency_job_id":"f2b1fce1-a3b1-4f09-bf22-9c1c44187414","html_url":"https://github.com/mateusjunges/afd","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mateusjunges/afd","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusjunges%2Fafd","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusjunges%2Fafd/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusjunges%2Fafd/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusjunges%2Fafd/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mateusjunges","download_url":"https://codeload.github.com/mateusjunges/afd/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusjunges%2Fafd/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33159099,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-17T22:39:12.733Z","status":"ssl_error","status_checked_at":"2026-05-17T22:39:10.741Z","response_time":107,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["afd","automaton","compilers","formal-languages","python"],"created_at":"2024-10-12T12:43:43.103Z","updated_at":"2026-05-17T23:32:18.927Z","avatar_url":"https://github.com/mateusjunges.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Deterministic Finite Automaton\n\nThe algorithm developed verify the validity of a string in an AFD.\nAs parameters, the function receives the AFD definition - name, final and goal states,\ninitial state, the transition function and the alphabet sigma.\n\nIt works basically reading each character of the given string.\nFirst, we check if the character is present in the alphabet. If yes,\nwe iterate through the transition functions and check if any of the functions\ntake us to the next state. Keep doing it until we finish the whole string.\n\nIf the last state is a goal state, the function returns `True`, and that string is\nvalid with the defined AFD. Otherwise, returns `False`, and the string is not valid with\nthe AFD.\n\nThe AFD definition should be in a text file. This file may contain:\n- The AFD name\n- The number of states\n- The initial state\n- A line with the goal states, comma separated\n- N lines with the transition functions. Each line is defined with a initial state, one input character\nand the next state, all separated with a comma. Example: `0,a,1`.\n\nThis is a valid AFD definition file:\n\n```text\nexample_AFD\n6\n0\nab\n2,4\n0,a,1\n1,b,2\n2,a,3\n3,a,4\n```  ","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmateusjunges%2Fafd","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmateusjunges%2Fafd","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmateusjunges%2Fafd/lists"}