{"id":23739124,"url":"https://github.com/serengti/theo_inf","last_synced_at":"2026-01-24T09:33:35.092Z","repository":{"id":145346840,"uuid":"125086193","full_name":"SerenGTI/Theo_Inf","owner":"SerenGTI","description":"Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart","archived":false,"fork":false,"pushed_at":"2019-02-28T10:55:49.000Z","size":9577,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-05-31T20:55:05.902Z","etag":null,"topics":["automata-theory","complexity-theory","computability-theory","formal-languages","theoretical-computer-science"],"latest_commit_sha":null,"homepage":"","language":"TeX","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/SerenGTI.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":"2018-03-13T17:02:03.000Z","updated_at":"2024-05-22T13:29:26.000Z","dependencies_parsed_at":"2024-04-19T08:15:55.540Z","dependency_job_id":null,"html_url":"https://github.com/SerenGTI/Theo_Inf","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/SerenGTI/Theo_Inf","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SerenGTI%2FTheo_Inf","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SerenGTI%2FTheo_Inf/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SerenGTI%2FTheo_Inf/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SerenGTI%2FTheo_Inf/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SerenGTI","download_url":"https://codeload.github.com/SerenGTI/Theo_Inf/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SerenGTI%2FTheo_Inf/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28723245,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-24T08:27:05.734Z","status":"ssl_error","status_checked_at":"2026-01-24T08:27:01.197Z","response_time":89,"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":["automata-theory","complexity-theory","computability-theory","formal-languages","theoretical-computer-science"],"created_at":"2024-12-31T09:32:33.972Z","updated_at":"2026-01-24T09:33:35.076Z","avatar_url":"https://github.com/SerenGTI.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Theoretische Informatik 1 bis 3\nEine Kurzzusammenfassung über die Module Formale Sprachen und Automatentheorie, Berechenbarkeit und Komplexität sowie Algorithmen und Diskrete Strukturen (Theoretische Informatik 1, 2 und 3) an der Universität Stuttgart, gehalten in WS 17/18 bis WiSe 18/19 von Prof. Dr. Ulrich Hertrampf.\n\nAlle Inhalte sind nach bestem Wissen und Gewissen selbst erstellt, es können Fehler enthalten sein. \n\nAbschnitte die inhaltlich zu Berechenbarkeit und Komplexität gehören können entweder noch komplett ausgelassen sein oder aber in einem deutlich unschönen Zustand sein. Diese werden in späteren Updates noch ausgebaut und verbessert.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fserengti%2Ftheo_inf","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fserengti%2Ftheo_inf","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fserengti%2Ftheo_inf/lists"}