This work describes models of modern language theory - finite automata, regular grammars and regular expressions. A web application converting among these models is implemented.
Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:236820 |
Creators | Podhorský, Michal |
Contributors | Techet, Jiří, Masopust, Tomáš |
Publisher | Vysoké učení technické v Brně. Fakulta informačních technologií |
Source Sets | Czech ETDs |
Language | Czech |
Detected Language | English |
Type | info:eu-repo/semantics/masterThesis |
Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0021 seconds