This work deals with Systems that combine automata and grammars. We investigate their properties compared with grammar systems and automaton systems. Work is focused on systems, which components are finite state automata, right linear grammars, pushdown automata or context free grammars. We also investigate usage of these systems in compilers.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:236636 |
| Date | January 2009 |
| Creators | Petřík, Patrik |
| Contributors | Křivka, Zbyněk, Meduna, Alexandr |
| 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.0022 seconds