Thesis Details
Simulace konečných převodníků
A quick translation between binary code and assembler for the purpose of simulation can be done by a special abstract model - a two-way coupled finite automaton. Its inner representation brings us to the question of finite transducers. As we know that simulation of deterministic transducers is more efficient, we have to concern ourselves with that process. Unfortunately, the existing algorithms are applicable just for transducers translating finite languages while we expect generally infinite language on input. Therefore it is important to find a way how to quickly detect the determinizability of the input transducer. In this bachelor's thesis, so far published works on the determinizability of finite transducers are brought together and a new algorithm of determinization of transducers translating generally infinite languages is presented. Undeterminizable transducers on input are detected.
finite transducer, determinization, determinizability, two-way coupled finite automaton, HW/SW co-design
Kolář Dušan, doc. Dr. Ing. (DIFS FIT BUT), člen
Martinek David, Ing. (DIFS FIT BUT), člen
Masopust Tomáš, RNDr., Ph.D. (DIFS FIT BUT), člen
Orság Filip, Ing., Ph.D. (DITS FIT BUT), člen
Sojka Petr, doc. RNDr., Ph.D. (FI MUNI), člen
@bachelorsthesis{FITBT6679, author = "Barbora Micenkov\'{a}", type = "Bachelor's thesis", title = "Simulace kone\v{c}n\'{y}ch p\v{r}evodn\'{i}k\r{u}", school = "Brno University of Technology, Faculty of Information Technology", year = 2008, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/6679/" }