|
|
Information System Supporting Festival Organisation
Křivohlávek, Dominik ; Klobučníková, Dominika (referee) ; Křivka, Zbyněk (advisor)
This thesis covers the modernization of an information system called HRYZ, which is used by organizers of the Animefest festival to organize the human resources needed for this festival. The chapters gradually introduce the content management systems, the information systems and the HRYZ information system itself. Then the chapters continue with a proposal for the system moderznization and a shift extension module modernization to ensure the compatibility with the base system. The modernization proposal was then implemented and tested with the users of current system. In the end, the new system was handed over to the festival organizers for further customziation and deployment.
|
|
|
New Versions of Translation Automata
Baláž, Miroslav ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis does research on new version of translation automata. It takes closer look at existing pushdown transcuders and regulated grammar. Combining these two concepts together which creates new regulated pushdown transcuder as a new form of translation automata. Examine computational power of regulated grammar and tests its usage combined with transcuder and test usablity of this new defined regulated transcuder in implementation for translating input source code.
|
|
|
Sequential and Parallel Grammars: Properties and Applications
Klobučníková, Dominika ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of sequential and parallel grammars. Both of these groups cover a large number of grammar families, most of which, however, are not widely used because of the difficulties related to their processing. The thesis examines some of these grammar types, such as scattered-context grammars, multigenerative systems, and interactive L-systems, with focus on their normal forms. Subsequently, it introduces a set of algorithms utilising properties of the discussed grammar types as well as their normal forms. These algorithms are based on the Cocke-Younger-Kasami algorithm for context-free grammars, and are capable of parsing any grammar in the corresponding normal form. Finally, a program implementing the proposed algorithms is presented.
|
|
|
General Grammars: Normal Forms with Applications
Klobučníková, Dominika ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of unrestricted grammars, normal forms, and their applications. It focuses on context-sensitive grammars as their special cases. Based on the analysis of the set, an algorithm was designed using the principles of the Cocke-Younger-Kasami algorithm to make a decision of whether an input string is a sentence of a context-sensitivegrammar. The final application, which implements this algorithm, works with context-sensitive grammars in the Penttonen normal form.
|
guest ::
