Multiple original results in the theory of automata and formal languages are presented, dealing mainly with combinatorial problems and complexity questions related to reset words and road coloring. The other results concern jumping finite automata and related types of rewriting systems. Powered by TCPDF (www.tcpdf.org)
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:331201 |
| Date | January 2015 |
| Creators | Vorel, Vojtěch |
| Contributors | Koubek, Václav, Mráz, František |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0114 seconds