Return to search

Redukce nedeterministických konečných automatů / Reduction of the Nondeterministic Finite Automata

Nondeterministic finite automaton is an important tool, which is used to process strings in many different areas of programming. It is important to try to reduce its size for increasing programs' effectiveness. However, this problem is computationally hard, so we need to search for new techniques. Basics of finite automata are described in this work. Some methods for their reduction are then introduced. Usable reduction algorithms are described in greater detail. Then they are implemented and tested. The test results are finally evaluated.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:237032
Date January 2011
CreatorsProcházka, Lukáš
ContributorsKořenek, Jan, Kaštil, Jan
PublisherVysoké učení technické v Brně. Fakulta informačních technologií
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0019 seconds