Thesis Details
Inference skákajících formálních modelů
This thesis is focused on grammatical inference in the way of evolutionary algorithms for jumping finite models. The first part explains jumping finite models as itself. More specifically, it describes jumping grammars and jumping automata. The next part deals with grammatical inference, evolutionary algorithms, and their important parts. According to the developed jumping models, said parts include strings generation and membership testing. These two algorithms are applied to chosen types of jumping finite automata---jumping finite automata, general jumping finite automata, and right one-way jumping finite automata. These four types of automata were tested, and in total, sixteen experiments were run. Results show that the inference works much better for automata without branching and with a small number of states and a small alphabet.
Jumping models, jumping automata, evolution algorithms, grammatical inference
Bidlo Michal, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Burgetová Ivana, Ing., Ph.D. (DIFS FIT BUT), člen
Lengál Ondřej, Ing., Ph.D. (DITS FIT BUT), člen
Matoušek Radomil, doc. Ing., Ph.D. (IACS FME BUT), člen
Vašíček Zdeněk, doc. Ing., Ph.D. (DCSY FIT BUT), člen
@mastersthesis{FITMT24429,
author = "Tina Heindlov\'{a}",
type = "Master's thesis",
title = "Inference sk\'{a}kaj\'{i}c\'{i}ch form\'{a}ln\'{i}ch model\r{u}",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2022,
location = "Brno, CZ",
language = "czech",
url = "https://www.fit.vut.cz/study/thesis/24429/"
}