|
|
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.
|
|
|
Patented solutions of professional laundry machinery
Čermák, Martin ; Kšenzuliak, Vladimír (referee) ; Bobák, Petr (advisor)
The subject of the thesis is national and international legal protection of technical solutions of professional laundry machinery with a view to a patent review creation procedure. The output is the review of already legally protected solutions relating to the reduction of industrial laundry energy consumption. The part of thesis is also a brief summary relating to the professional laundry care process.
|
|
|
Embedded Modules of Modern Mobile Devices
Pelikán, Ondřej ; Čermák, Martin (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis concerns mobile application development for Windows Phone 7 platform focused on lifestyle changes and dealing with problems concerning weight, physical condition and appearance. The application uses built-in modules of modern mobile phones like GPS navigation, high resolution camera and Internet connection. The application development description starts from general introduction of the issue, through description of main features of the platform Windows Phone 7, concrete architecture of the application and solution of implementation problems, to description of methods and tools used for the design and planning, library and third-party framework description.
|
|
| |
|
|
Demonstration of Tree Controlled Grammars Properties
Kunštátský, Martin ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
Tree controlled grammars are grammars regulated by restriction placed on its derivation trees. It is simple and natural extension of context-free grammars. There are several types of derivation tree control, two principles are mentioned in this work: horizontal and vertical control. Application demonstrating tree controlled grammars properties, implemented in Python programming language, is also part of this work.
|
|
|
LaTeX and Microsoft Power Point Presentations Convertor
Černý, Lukáš ; Čermák, Martin (referee) ; Křivka, Zbyněk (advisor)
This work deals with theoretical and practical basis for the creation of converter between LaTeX and Microsoft PowerPoint presentations. It discusses the use of LaTeX and the Beamer class for presentations, programmatic creation of PowerPoint documents using PowerPoint Primary Interop Assemblies and PresentationML. It outlines the use of the scanners and parsers generators GPLEX and GPPG respectively. It deals with the characteristics of today's tools for document conversion. And finally deals with the particular pitfalls of the design, implementation and testing of the application for conversion of documents between LaTeX platform and Microsoft PowerPoint.
|
|
|
Suffix Arrays Construction and Their Use in Bioinformatics
Hlávka, Ondřej ; Čermák, Martin (referee) ; Martínek, Tomáš (advisor)
This work describes perspective data structure called suffix array. This data structure is described in more detail and this paper also contains taxonomy of suffix array construction algorithms. A few algorithms are described more precisely and most space is devoted to algorithm called qsufsort. Finally we will show how can be suffix array used in practice. This work shows usage of suffix array in exact (binary search) and approximate (QUASAR) string matching in DNA sequences.
|
|
|
Intelligent Web Planner of Work
Halfar, Martin ; Jirák, Ota (referee) ; Čermák, Martin (advisor)
This bachelor's thesis deals with usage of Evolutionary algorithm while intelligently planning the distribution of work for a group of people. Especially, Genetic algorithm is addressed, which is one of techniques of evolutionary algorithm inspired with biological evolutionary processes.Every solution is branded as an individual of population and only the most adapted ones are allowed to reproduce.
|
|
|
Parallel Syntax Analysis
Otáhal, Jiří ; Koutný, Jiří (referee) ; Čermák, Martin (advisor)
This thesis focuses on modern methods of language description. It introduces several controlled grammars, describing in detail the tree controlled grammar. The thesis is based on relatively new technique of syntax analysis using tree controlled grammars. The process of this analysis is described in detail, followed by a design of parallel-processing of this analysis. We managed to succesfully implement this design, speed up the syntax analysis and therefore achieve the main goal of the thesis.
|
|
|
Graphical Simulation of Finite Automata
Šrajer, Roman ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
This Bachelor's Thesis is about the theory of converting regular expression to finate state machine and vice versa. The goal of practical part is to make web application that performs these coversions and do simulation for input string. For converting automata into regular expression it is used the algebraic method which is based on making an equation system to be solved. I have chosen Java as programming language and Java Applet and Java Web Start as technologies that make possible to access the application through the web page. The possibilities like working with three types of automata views, saving atomatons into XML and intuitively creating own automatons are the important part of the application.
|
guest ::
RSS feed.