|
|
Language for Procedural Generation
Dobiáš, Roman ; Káčerik, Martin (referee) ; Milet, Tomáš (advisor)
This thesis deals with designing and implementing a library with language devoted to procedural generation extending L-systems. Emphasis is put on practical usage of the library which is aimed to be used by a wide spectrum of real-world applications, especially by 3D rendering engines and editors. The thesis covers theory of procedural generation, L-systems, theory of compilers, and design and implementation of the library. In conclusion, case study projects are introduced which embed the library and numerous examples are given.
|
|
|
Languages, Grammars and Machines
Mocková, Ľubica ; Zimmerová, Barbora (referee) ; Bobalová, Martina (advisor)
My thesis is a brief synopsis of the basic types of formal languages, grammars and machines, which are a part of theoretical computer science. My thesis contains the survey of the theory related to the given topic and problems related to the theoretical part of my thesis. This work is to be used as a study material for the students of the Faculty of Business and Management for the subject of Discrete Mathematics. It can also be helpful for the students of other universities and faculties whose curricula contain theory of grammars and machines.
|
|
|
Parsing Based on State Grammars
Svatý, Lukáš ; Vrábel, Lukáš (referee) ; Solár, Peter (advisor)
Syntax-directed translation based on state grammars is introduced in this bachelor's thesis. Theoretical section of this thesis is focused on the introduction of theoretical models that are necessary for understanding syntax analysis based on state grammars. The most important theoretical formal models in this thesis include deep pushdown transducer and translation grammar based on state grammar, which can be used in syntax analysis. Practical section of this thesis is focused on bottom-up syntax analysis using state grammar and its implementation.
|
|
|
Modified Deep Pushdown Automata
Škvařilová, Radka ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This thesis introduce two new modifications of deep pushdown automata - stateless deep pushdown automata and parallel deep pushdown automata. In theoretical part of this thesis is formal definition and research into power of these modification. Practical part consists of an implementation of simple automata program.
|
|
|
Mathematical methods of morphology modelling of coniferous trees
Janoutová, Růžena ; Štarha, Pavel (referee) ; Martišek, Dalibor (advisor)
The thesis was focused on creation of a coniferous tree by nondestructive method allowing description of structure of adult spruce trees. After processing provided data we created a model of L-system which creates a tree branch. Thereafter, a Python script generated parameters which were required for the creation of the model of the tree in graphical software Blender. Model of coniferous tree was sucesfully generated. Its memory requirements are high but for our purposes this is not an essential problem.
|
|
|
Classification of Grammars, Languages and Machines (Basic Types, Use)
Klimešová, Michaela ; Novotný, Jan (referee) ; Bobalová, Martina (advisor)
This bachelor's thesis is written as a brief list of fundamental theory on the given topic with extensions of working out methods and solving examples. The thesis is divided into two basic parts. The first part is focused on the essential theoretical pieces of knowledge about languages, grammars and machines. There is a particular explanation of the theory related to formal languages and operations on languages, grammars and their separation, and to finite state machines, together with dividing them into deterministic and nondeterministic ones. The second part is devoted to working out, explanation and calculation of the examples applied to the given topic - from the simple ones to the difficult ones.
|
|
|
Regulated Automata Systems
Krčmář, Radim ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis defines and studies two new types of automata, cooperating distributed pushdown automata systems (CDPDAS) and parallel communicating pushdown automata systems (PCPDAS). CDPDAS and PCPDAS adapt the main concept of cooperating distributed grammar systems (CDGS) and parallel communicating automata systems (PCPDAS), respectively. CDPDAS are proven to have the same power as PDA and this thesis further explores the reason why CDPDAS do not increase power while CDGS do and introduces an automata system inspired by CDPDAS that does increase the power. PCGS have similar power as CDGS, but PCPDAS are equvalent with TM, which is proven by creating a communication protocol to access a second stack.
|
|
|
Multi-Dimensional Languages and Their Automata
Dibďák, Lukáš ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The Bachelor's Thesis introduces the theory of formal languages and finite automata. It describes generalisation of one-dimensional theory into two dimensions. It introduces basic types of two-dimensional automata, especially on-line tessellation automata. This paper offers algorithms for the process of determinization of on-line tessellation automata. One of the algorithms is used in enclosed application.
|
|
|
Grammar Systems Applied to Parsing
Martiško, Jakub ; Kolář, Dušan (referee) ; Meduna, Alexandr (advisor)
This paper deals with different variants of grammar systems. Grammar systems combine the simplicity of Context Free Grammars with the generative power of more complex gammars. There are two main variants of grammar systems described in this paper: PC grammar systems and CD grammar systems. New type of grammar system, which is a modification of the CD grammar systems, is also described in the paper. New method of parsing, based on this new grammar system is proposed in the paper. This new parser consists of several smaller parsers, which work in both top down and bottom up way.
|
|
|
Parallel Deep Pushdown Automata
Solár, Peter ; Křivka, Zbyněk (referee) ; Meduna, Alexandr (advisor)
This thesis introduces parallel deep pushdown automata as the parallel version of the deep pushdown automata. They are based on the rules, where the automaton can expand n topmost non-terminals in only one derivation step if there are enough non-terminals on the pushdown. The main advantage rests in a fact, that parallel automaton can makde a decission faster.
|
guest ::
