|
|
Reduction of the Nondeterministic Finite Automata
Procházka, Lukáš ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor)
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.
|
|
|
Artificial Intelligence in Modern Computer Games
Pavliska, Jiří ; Zuzaňák, Jiří (referee) ; Mikolov, Tomáš (advisor)
The aim of this bachelor's thesis is to propose an artificial inteligence that could be used to create a modern computer game. My intention is to introduce the termin Artificial Inteligence to the reader. I include the description of elements and techniques used for determining the behavior of figures that are controlled by a computer. I am also focusing the abilities of the program to search the state space and to find the shortest possible way.
|
|
|
Artificial Intelligence in Modern Computer Games
Pavliska, Jiří ; Zuzaňák, Jiří (referee) ; Mikolov, Tomáš (advisor)
The aim of this bachelor's thesis is to propose an artificial inteligence that could be used to create a modern computer game. My intention is to introduce the termin Artificial Inteligence to the reader. I include the description of elements and techniques used for determining the behavior of figures that are controlled by a computer. I am also focusing the abilities of the program to search the state space and to find the shortest possible way.
|
|
|
Reduction of the Nondeterministic Finite Automata
Procházka, Lukáš ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor)
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.
|
guest ::
