Thesis Details
Knihovna pro konečné automaty a převodníky
Finite state automata are widely used in the field of computer science such as formal verification, system modelling, and natural language processing. However, the models representing the reality are complicated and can be defined upon big alphabets, or even infinite alphabets, and thus contain a lot of transitions. In these cases, using classical finite state automata is not very efficient. Symbolic automata are more concise by employing predicates as transition labels. Finite state transducers also have a wide range of application such as linguistics or formal verification. Symbolic transducers replace classic transition labels with two predicates, one for input symbols and one for output symbols. The goal of this thesis is to design a library for letter and symbolic automata and transducers which will be suitable for fast prototyping.
finite state automata, symbolic automata, transducers, efficient algorithms, formal verification
Janoušek Vladimír, doc. Ing., Ph.D. (DITS FIT BUT), člen
Novák Michal, doc. RNDr., Ph.D. (DMAT FEEC BUT), člen
Strnadel Josef, Ing., Ph.D. (DCSY FIT BUT), člen
Szőke Igor, Ing., Ph.D. (DCGM FIT BUT), člen
@bachelorsthesis{FITBT20123, author = "Michaela Bielikov\'{a}", type = "Bachelor's thesis", title = "Knihovna pro kone\v{c}n\'{e} automaty a p\v{r}evodn\'{i}ky", school = "Brno University of Technology, Faculty of Information Technology", year = 2017, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/20123/" }