{"id":15317520,"url":"https://github.com/mehanix/dfa-nfa-acceptor","last_synced_at":"2025-04-05T12:22:35.493Z","repository":{"id":98053494,"uuid":"247276898","full_name":"mehanix/DFA-NFA-Acceptor","owner":"mehanix","description":"🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.  ","archived":false,"fork":false,"pushed_at":"2020-03-27T19:21:52.000Z","size":1600,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-10T23:37:05.761Z","etag":null,"topics":["automata","computer-science","deterministic-finite-automata","dfa","formal-languages","homework","homework-assignments","homework-exercises","nfa","nondeterministic-finite-automata"],"latest_commit_sha":null,"homepage":"","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/mehanix.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":"2020-03-14T12:57:49.000Z","updated_at":"2023-05-02T18:48:19.000Z","dependencies_parsed_at":null,"dependency_job_id":"6cebf495-a94f-4c89-8a96-ab57ee70d215","html_url":"https://github.com/mehanix/DFA-NFA-Acceptor","commit_stats":{"total_commits":12,"total_committers":1,"mean_commits":12.0,"dds":0.0,"last_synced_commit":"3db4cc707cc52eed910d726e00fd2e8c7e77ef50"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mehanix%2FDFA-NFA-Acceptor","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mehanix%2FDFA-NFA-Acceptor/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mehanix%2FDFA-NFA-Acceptor/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mehanix%2FDFA-NFA-Acceptor/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mehanix","download_url":"https://codeload.github.com/mehanix/DFA-NFA-Acceptor/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247334062,"owners_count":20922135,"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","computer-science","deterministic-finite-automata","dfa","formal-languages","homework","homework-assignments","homework-exercises","nfa","nondeterministic-finite-automata"],"created_at":"2024-10-01T08:57:17.093Z","updated_at":"2025-04-05T12:22:35.469Z","avatar_url":"https://github.com/mehanix.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LFA_proiect_1\nTema 1 la Limbaje Formale si Automate, Anul 1 UniBuc\n\n![screenshot-proiect](https://i.imgur.com/860BKjs.png)\n![screenshot-generare](https://i.imgur.com/HoAyPyp.png)\n\n## Cerinta temei\n1) Sa se scrie un program care incarca in memorie un DFA/NFA, apoi verifica daca automatul accepta cuvintele date de utilizator.\n\n2) Sa se genereze cele mai scurte 100 cuvinte acceptate de automat.\n\n## Implementare\nAm folosit o structura de date custom pentru a salva graful in memorie. (vector de map(lista de noduri), care mapeaza literele alfabetului la vectori cu directiile unde poti pleca din acel nod) `vector\u003cmap\u003cchar,vector\u003cint\u003e\u003e\u003e`\n\nAm mai folosit si o matrice de vizitati, unde tineam evidenta drumului meu curent, pentru a evita sa ma duc de 2 ori cu aceeasi lungime curenta inspre acelasi nod. `vector\u003cvector\u003cbool\u003e\u003e, unde nr_linii = nr_noduri, si nr_coloane = word.length()`\n\nVerificarea apartenentei unui cuvant in automat este un DFS, practic.\n\nGenerarea celor mai scurte cuvinte se face cu algoritmul BFS si cu un queue in care tin drumurile gasite. La fiecare pas, scot drumul curent din coada, iau ultimul element, si daca nu este element final, verific unde pot sa plec din el, si adaug la sfarsitul cozii noile drumuri create.\n\nTotodata, folosesc matricea de vizite pentru a avea grija sa nu ma blochez in bucle.\n\n## Features\n* Incarcare automat custom din fisierul automat_custom.in\n* Incarcare automat generat (cel cu 3004 noduri si 2002002 muchii) pentru a demonstra functionalitatea matricii de vizitati\n* Testarea cuvintelor in automat\n* Generarea cele mai scurte 100 cuvinte acceptate de automat\n\n## Structura fisier intrare\n```\nnumar_noduri\nnumar_muchii\nnod_x nod_y caracter (de numar_muchii ori)\nnod_start\nnumar_noduri_finish\nnod_finish_x (de numar_noduri_finish ori)\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmehanix%2Fdfa-nfa-acceptor","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmehanix%2Fdfa-nfa-acceptor","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmehanix%2Fdfa-nfa-acceptor/lists"}