{"id":17183366,"url":"https://github.com/teodutu/lfa","last_synced_at":"2026-02-19T11:32:25.514Z","repository":{"id":121178680,"uuid":"233543638","full_name":"teodutu/LFA","owner":"teodutu","description":"Tema la LFA - 2020","archived":false,"fork":false,"pushed_at":"2020-01-15T16:48:36.000Z","size":1764,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-24T17:12:06.732Z","etag":null,"topics":["deterministic-finite-automata","formal-languages","jflex"],"latest_commit_sha":null,"homepage":null,"language":"OpenEdge ABL","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/teodutu.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}},"created_at":"2020-01-13T08:09:55.000Z","updated_at":"2022-06-13T20:29:45.000Z","dependencies_parsed_at":"2024-06-12T01:46:39.082Z","dependency_job_id":null,"html_url":"https://github.com/teodutu/LFA","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/teodutu/LFA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/teodutu%2FLFA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/teodutu%2FLFA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/teodutu%2FLFA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/teodutu%2FLFA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/teodutu","download_url":"https://codeload.github.com/teodutu/LFA/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/teodutu%2FLFA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29611094,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-19T10:52:55.328Z","status":"ssl_error","status_checked_at":"2026-02-19T10:52:26.323Z","response_time":117,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: 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":["deterministic-finite-automata","formal-languages","jflex"],"created_at":"2024-10-15T00:40:22.651Z","updated_at":"2026-02-19T11:32:25.498Z","avatar_url":"https://github.com/teodutu.png","language":"OpenEdge ABL","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LFA\nTema la LFA - 2020\n\nFiecare cerinta este rezolvata din prima parsare a inputului. In anumite stari\nale *AFD*-ului care parseaza fisierul de input, se stocheaza/calculeaza\nstructurile necesare rezolvarii respectivelor cerinte: graful starilor si\ntranzitiilor, graful transpus si multimile de stari accesibile si utile.\n\n## -e\nPur si simplu se verifica daca vreuna dintre starile finale este cea initiala.\n\n## -a si -u\nAceste cerinte se rezolva similar: parcurgand cu un *BFS* din starea initiala,\nrespectiv din starile finale graful ce reprezinta *AFD*-ul, respectiv acelasi graf\ntranspus. Din prima parcurgere rezulta starile accesibile, iar din cea de-a doua\ncele productive. Starile utile sunt intersectia acestor doua multimi.\n\n## -v\nLimbajul este vid daca starile finale nu sunt accesibile. La citirea fiecarei\nstari finale se verifica daca aceasta este si accesibila.\n\n## -f\nSe testeaza cu un *DFS* care verifica daca exista cicluri in *AFD*. Din moment ce\ndaca un nod dintr-un ciclu este util, toate nodurile sunt utile, in momentul in\ncare se depisteaza un ciclu se verifica un singur nod.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fteodutu%2Flfa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fteodutu%2Flfa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fteodutu%2Flfa/lists"}