Programming Using Symbolic Automata and Transducers
Symbolic automata and transducers are extensions to finite automata which allow transitions with predicates and functions. The aim of this thesis is to study and give an overview of programming languages that are built on symbolic automata and transducers. The main focus is on the programming language Bek but a short overview of two similar languages Bex and Fast is given as well. The thesis also gives an overview of the scope of the programs that can be written with tools based on automata and transducers.
Graduation Thesis language
Graduation Thesis type
Bachelor - Computer Science