Thesis Details
Mnohaúrovňové automaty a jejich aplikace
In this thesis, we will add to already known fnite automata paradigm. We start withbasic defnitions used in theoretical informatics. Afterwards we defne multi-level fniteautomata, which is the base of this thesis. Then we move on to the compilation processand construction of a compiler. With that we defne lexical analysis as our example formulti-level fnite automata implementation. Once we implement the concept, we comparethe new and the old way. Then we dig deeper into theoretical informatics to defne parallelright-linear grammars and languages. To prove a concept we create another concept withimplementation strategy, using multi-level framework. Lastly, we mention some other areasin informatics, where this multi-level concept could be useful.
fnite automata, multi-level finite automata, multi-level concept, parallelism in theoreticalinformatics, parallel right-linear grammars, compilation, compiler, lexical analysis
Grézl František, Ing., Ph.D. (DCGM FIT BUT), člen
Honzík Jan M., prof. Ing., CSc. (DIFS FIT BUT), člen
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Smrčka Aleš, Ing., Ph.D. (DITS FIT BUT), člen
@bachelorsthesis{FITBT21314,
author = "Kamil P\v{s}en\'{a}k",
type = "Bachelor's thesis",
title = "Mnoha\'{u}rov\v{n}ov\'{e} automaty a jejich aplikace",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2019,
location = "Brno, CZ",
language = "czech",
url = "https://www.fit.vut.cz/study/thesis/21314/"
}