Original results in computational and combinatorial theory of reset words in transition systems, road coloring in directed graphs, and discontinuous input processing in formal languages are presented, including strong lower bounds on subset synchronization thresholds, lower bounds on descriptive power of jumping finite automata, and corresponding complexity classifications.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:391347 |
| Date | January 2018 |
| Creators | Vorel, Vojtěch |
| Contributors | Čepek, Ondřej, Otto, Friedrich, Průša, Daniel |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/doctoralThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.002 seconds