|
|
Synchronous Formal Systems Based on Grammars and Transducers
Horáček, Petr ; Janoušek, Jan (referee) ; Yamamura,, Akihito (referee) ; Meduna, Alexandr (advisor)
Tato disertační práce studuje synchronní formální systémy založené na gramatikách a převodnících a zkoumá jak jejich teoretické vlastnosti, tak i perspektivy praktických aplikací. Práce představuje nové koncepty a definice vycházející ze známých principů řízeného přepisování a synchronizace. Navrhuje alternativní způsob synchronizace bezkontextových gramatik, založený na propojení pravidel. Tento princip rozšiřuje také na řízené gramatiky, konkrétně gramatiky s rozptýleným kontextem a maticové gramatiky. Dále je představen na podobném principu založený nový druh převodníku, tzv. pravidlově omezený převodník. Jedná se o systém složený z konečného automatu a bezkontextové gramatiky. Práce prezentuje nové teoretické výsledky ohledně generativní a přijímajicí síly. Poslední část práce zkoumá možnosti lingvisticky orientovaných aplikací se zameřením na překlad přirozeného jazyka. Diskutuje a srovnává hlavní výhody nových modelů s využitím vybraných případových studií z českého, anglického a japonského jazyka pro ilustraci.
|
|
|
Systems of Parallel Grammars
Skácel, Jiří ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This article defines cooperating distributed grammar systems with E0L components instead of context-free grammars and discusses its generative power mainly in respect to ET0L systems. It recapitulates results about CD GS, then defines modified systems and shows that this combination has in most derivative modes equal strength to ET0L, except for terminating mode, which is shown to be more powerful. There are also explained examples of this new kind of systems.
|
|
|
Futoshiki Puzzle
Benedikti, Tomáš ; Horáček, Petr (referee) ; Zámečníková, Eva (advisor)
This thesis deals with the topic of logical games and puzzles. The main focus is on the Futoshiki puzzle, its history and rules. The algorithms created for the application are covered in depth, from the design to the implementation. The last part contains the creation of the user interface and testing the success of the application.
|
|
|
Japanese Character Description
Holáň, Jakub ; Zámečníková, Eva (referee) ; Horáček, Petr (advisor)
The Japanese language has from historical reasons a very complicated orthographical system based on more interconnected alphabets where the characters can be logograms (characters representing whole words) as well as phonograms (characters representing single sounds or syllables of a language). When searching or compiling a japanese dictionary various nontrivial methods of sorting these characters have to be used, e.g. sorting them by number of strokes or by radicals (basic building elements of a character). The aim of this thesis is to find an ideal database structure to accurately describe japanese characters and relationships between them. For good measure, a demonstration application has been developed, which can be used as a learning and revision tool for japanese students. The application is intended for internet use and it has been put together using the most up to date web technologies, such as Google Web Toolkit and Java servlets.
|
|
| |
|
|
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.
|
|
|
Checkers - like Network Game
Semerád, Lukáš ; Horáček, Petr (referee) ; Čermák, Martin (advisor)
This bachelor thesis is concerned with board game checkers. It summarizes the history and previous games. The thesis discusses the various versions of the rules that are played around the world. It also deals with the analysis of algorithms for a computer game. The result of this work is a program that allows the game two players, game via network and play against the computer. Also allows different setting default rules.
|
|
|
Compiler Warnings Filter
Krajčovičová, Mária ; Horáček, Petr (referee) ; Zemek, Petr (advisor)
Goal of this bachelor's thesis was design and implementation of program which filtrate warnings from compiler output without hitting the source codes. The bachelor's thesis describes compilers as GCC, Clang, Javac and GHC. It describes also their functionality and types of warnings from their outputs. Result of the bachelor's thesis is an application which is able warning filltration for mentioned compilers.
|
|
|
Deep Pushdown Automata of Finite Index
Poncová, Vendula ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This thesis introduces several modifications of deep pushdown automata considering the reduced number of states or non-input symbols. It is shown that the power of deep pushdown automata of finite index is not affected by a limitation of non-input symbols to one, thus these automata characterize an infinite hierarchy of language families resulting from programmed grammars of finite index. Based on a principle of these automata, it is established the normal form of deep pushdown automata. Finally, I introduce generalized deep pushdown automata. They expand the topmost possible non-input symbol in the pushdown. These automata and their reduced forms are equivalent to state grammars.
|
|
|
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.
|
guest ::
RSS feed.