|
|
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.
|
|
|
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.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
|
|
Interactive Generator of Syntax of Heterogeneous Data Structures
Kotraš, Martin ; Janoušek, Vladimír (referee) ; Smrčka, Aleš (advisor)
Today, software systems are often composed of several components that transmit data through various communication channels. Despite the fact that there are a number of standardized data encoding formats, developers still create their own mostly with regard to the specific use of the software they create. One of the essential parts of quality verification or minimization of data transmission errors is the validation of input data. The first step to validation is to formalize a language describing data structures. The most general formalism for these purposes is the grammar of the language in the standard description, e.g. BNF, ABNF, or EBNF. However, creating a language-specific grammar can be a step that is sensitive to error for an inexperienced developer. The aim of this project is a simple application for creating grammar from a sample of data. The work solves the generation of grammar and validation code snippets from the sample string of the language, e.g. the source code of the programming language. The user solves the problem by sequentially marking parts of the uploaded string, naming them, and assigning properties to them. This is aided by tools for splitting rules, merging rule prefixes and/or suffixes, creating lists, and optimizing the resulting rules. As part of the work, a single-page web application was created, which was able to pass relatively well when tested on JSON and XML, and it was possible to create a more general grammar despite the problems with a weak parser. Thanks to this work, even less experienced users can create more general grammars of their strings and use them for validation purposes. In addition, the work provides a basis for further research in this area and is open to further improvement.
|
|
|
From user stories to organisational learning
Henao Pacheco, Fernando
Abstract Henao Pacheco, Fernando. From user stories to organisational learning, a for-mal language to specify requirements. Diploma thesis. Brno: Mendel University, 2023. Failures in software requirements can be the cause of project collapse. Agile soft-ware development should implement the functionalities with user stories to cover the project scope. Usually, these projects are incremental and evolutive. This dynamic and adaptive environment could need formal specifications to clarify the main goal per user story and create test cases. Also, to diminish vague-ness, inconsistency, insufficiency, and duplicity as user stories ambiguity prob-lems. This thesis aims to create a formal language to describe user stories to facil-itate project planning and development, estimation, code reuse, and diagramming. By using the language, the software team should acquire explicit knowledge.
|
|
|
Alternative Transformations of Grammars
Havel, Martin ; Křivka, Zbyněk (referee) ; Meduna, Alexandr (advisor)
Tato práce poskytuje alternativní algoritmus pro odstranění epsilon-pravidel z E0S gramatik. Oproti standardnímu způsobu odstranění epsilon-pravidel ve většině gramatik podobných E0S gramatikám, jako bezkontextové gramatiky, tato metoda nevyžaduje predeterminizaci symbolů, které generují prázdné řetězce. Navržený algoritmus je formálně verifikován. V implementační kapitole práce, navržený algoritmus je implementován a použitelnost algoritmu na E0S gramatikách je demonstrována. Na závěr je algoritmus vyhodnocen a jsou nastíněny dvě otevřené oblasti.
|
guest ::
