|
|
Simple Czech Grammar Correcttor for OpenOffice
Ličko, Jozef ; Herout, Adam (referee) ; Smrž, Pavel (advisor)
The grammar of natural language is generally complex. Often, it is very difficult to describe it precisely in a formal way. There are several approaches to grammar correction using computer technologies. This thesis deals with the construction of a simple rule-based Czech grammar checker. It focuses on subordinate relative constructions. The corrector is designed to identify missing comma in them. If such a sentence is found the program proposes possible suggestions how to correct it. The application operates as a plugin for OpenOffice suite.
|
|
| |
|
|
Visualization of Finite Automata, Pushdown Automata and Turing Machines Work
Syrový, Ondřej ; Láník, Aleš (referee) ; Zuzaňák, Jiří (advisor)
This bachelor`s thesis is focusing on concept and development of computer application for demonstration of finite automata, pushdown automata and Turing machines work. Theoretic volume of this work deals with theories of formal languages and grammars and automata theory. Created program allows to load deterministic and nondeterministic automata variants from the text file, their graphic representation by state diagram and stepping their calculation process.
|
|
| |
|
|
Syntactic Analysis Based on Matrix Grammar
Brindza, Dominik ; Horáček, Petr (referee) ; Zámečníková, Eva (advisor)
The subject of this thesis is to develop a method of syntactic analysis based on matrix grammar s. In its theoretical part we provide various analytical aspects for this type of regulated grammar in order to reveal the common background as well as search for similarities with the classical context-free grammars which we will then be able to benefit from in the practical part. Our goal is to extend the well-known predictive method of syntactic analysis to further accept a wider spectrum of formal languages - some of the context-sensitive ones which we are able to generate using our matrix grammars. Besides this main effort we also present some experimental algorithms and suggestions hich could be used in further research of this project.
|
|
| |
|
|
Formal Systems Based on Automata and Grammars
Čermák, Martin ; Rybička, Jiří (referee) ; Šaloun, Petr (referee) ; Meduna, Alexandr (advisor)
Tyto teze navazují na studium gramatických a automatových systémů. Na začátku, práce pojednává o regulárně řízených CD gramatických systémech využívající frázově strukturované gramatiky jako komponenty. Do systémů jsou zavedena tři nová omezení na derivacích a je studován jejich vliv na vyjadřovací sílu těchto systémů. Poté, tato práce definuje dva automatové protějšky ke kanonickým multi-generatiním nonterminálem a pravi\-dlově synchronizovyným gramatickým systemům, generujících vektory řetězců, a ukazuje, že všechny tyto vyšetřované systemy si jsou vzájemně ekvivalentní. Dále táto práce tyto systémy zobecňuje a zakládá fundamentalní hierarchii n-jazyků (množin n-tic řetězců). V~souvislosti se zavedenými systémy tyto teze zavádí automatově-gramatický převodník založený na konečném automatu a bezkontextové gramatice. Tento převodník je pak studovaný a použitý jako nástroj přímého překladu. V~poslední části jsou v této práci zavedené automatové systémy jádrem pársovací metody založené na stromově řízených gramatikách s n omezenými cestami.
|
|
|
Procedurally Generated City
Panáček, Petr ; Šolony, Marek (referee) ; Kajan, Rudolf (advisor)
This paper deals with problem of procedurally generated city. There are described steps of creation of city. These steps are: road generation, extraction of minimal cycles in graph, division of lots and generation of buildings. Road and buildings are generated by L-system. Our system generate a city from input images, such as height map, map of population density and map of water areas. Proposed approaches are used for implementation of application for generation of city.
|
|
|
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.
|
|
|
Enhancement of Probabilistic Methods for Password Cracking
Lištiak, Filip ; Polčák, Libor (referee) ; Hranický, Radek (advisor)
This thesis describes passwords cracking using probabilistic context-free grammars, specifically PCFG Cracker tool. The aim of the thesis is to design and implement enhancements to this tool, which reduce the size of output dictionaries while maintaining acceptable success rate. This work also solves critical parts in the tool that slow down the overall duration of the program. Another goal of the thesis is to analyze and implement targeted attack dictionaries that increase the scope and success rate of generated passwords.
|
guest ::
