Interaktivní nástroj pro výuku konečných automatů

Abstract

The aim of the bachelor's thesis is to create a tool for students that would serve as a tool for teaching finite automata and regular expressions. In the first part of the thesis, we will explain the basics of finite automata and regular expressions. We will discuss the acceptance of a word by a finite automaton, its types, properties, conversion non-deterministic finite automata into deterministic and set operations over languages. We will also discuss regular languages and regular expressions and show how regular expressions can be converted to finite automata. In second part we will focus on the implementation and design of our software work. We will describe how the tool was designed and what technologies were used.