{"id":22859872,"url":"https://github.com/harmim/vut-tin-homeworks","last_synced_at":"2026-01-11T05:40:19.796Z","repository":{"id":74891471,"uuid":"217206111","full_name":"harmim/vut-tin-homeworks","owner":"harmim","description":"Teoretická informatika - Domácí úkoly","archived":false,"fork":false,"pushed_at":"2019-12-30T15:57:03.000Z","size":1285,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-06T12:48:08.767Z","etag":null,"topics":["automata","automata-theory","formal-languages","languages","theoretical-computer-science","tin","vut","vut-fi"],"latest_commit_sha":null,"homepage":"","language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/harmim.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":"2019-10-24T03:46:37.000Z","updated_at":"2021-09-06T15:36:31.000Z","dependencies_parsed_at":null,"dependency_job_id":"53079fee-ed81-45b8-8502-cb84ce29a179","html_url":"https://github.com/harmim/vut-tin-homeworks","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/harmim%2Fvut-tin-homeworks","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/harmim%2Fvut-tin-homeworks/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/harmim%2Fvut-tin-homeworks/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/harmim%2Fvut-tin-homeworks/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/harmim","download_url":"https://codeload.github.com/harmim/vut-tin-homeworks/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246436713,"owners_count":20777074,"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","automata-theory","formal-languages","languages","theoretical-computer-science","tin","vut","vut-fi"],"created_at":"2024-12-13T09:08:18.819Z","updated_at":"2026-01-11T05:40:19.769Z","avatar_url":"https://github.com/harmim.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Teoretická informatika - Domácí úkoly\n\n#### Autor: Dominik Harmim \u003charmim6@gmail.com\u003e\n\n### Úkoly:\n1. [Řešení problému z oblasti regulárních a bezkontextových jazyků](1%20%7C%20%C5%98e%C5%A1en%C3%AD%20probl%C3%A9mu%20z%20oblasti%20regul%C3%A1rn%C3%ADch%20a%20bezkontextov%C3%BDch%20jazyk%C5%AF)\n2. [Řešení problému z oblasti Turingových strojů a teorie nerozhodnutelnosti](2%20%7C%20Řešení%20problému%20z%20oblasti%20Turingových%20strojů%20a%20teorie%20nerozhodnutelnosti)\n3. [Řešení problému z oblasti vyčíslitelných funkcí, složitosti a Petriho sítí](3%20%7C%20Řešení%20problému%20z%20oblasti%20vyčíslitelných%20funkcí%2C%20složitosti%20a%20Petriho%20sítí)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharmim%2Fvut-tin-homeworks","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fharmim%2Fvut-tin-homeworks","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharmim%2Fvut-tin-homeworks/lists"}