National Repository of Grey Literature 37 records found  1 - 10nextend  jump to record: Search took 0.03 seconds. 
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.
A Combination of Automata and Grammars
Kučera, Jiří ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
V této práci byly zavedeny a studovány nové systémy formálních modelů, zvané stavově synchronizované automatové systémy stupně n . Výpočet je v těchto prezentovaných systémech řízen pomocí slov patřících do konečného řídícího jazyka, kde každé slovo z tohoto jazyka je složeno ze stavů komponent systému. Dále byla v této práci studována výpočetní síla zavedených systémů. Praktické použití zavedených systémů bylo demonstrováno na příkladu z oblasti překladu přirozených jazyků a dále na příkladu z oblasti paralelního překladu.
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.
Generating Code of Optimised Mathematical Operations
Beneš, Vojtěch ; Horáček, Petr (referee) ; Čermák, Martin (advisor)
Bachelor's thesis deals with creating a simple programming language for working with mathematical operations. Main point of the thesis is to create a compiler of this language, which is using MMX technology to generate instructions of an assembler code. The optimized code generation is based on modified algorithm of context generation.
Support for Form Filling in Web Browser
Čekan, Ondřej ; Horáček, Petr (referee) ; Křivka, Zbyněk (advisor)
This thesis deals with the creation of an extension for the selected web browser, which should make working with web forms much easier for the user. The document describes ways how to automatically fill in data forms and principles of their storage. It also deals with tools for writing SMS messages, such as text compression, removal of diacritics, spell check. In thesis also discusses the often repeated filling in data forms. In conclusion, there are mentioned results of the thesis with possible future expansion proposals in the document.
Caligraphy Editor with Japanese Character Recognition
Horáček, Petr ; Žák, Pavel (referee) ; Švub, Miroslav (advisor)
This work focuses on creating an application to support Japanese character learning. It also contains a brief overview of Japanese writing's history and evolution. Based on the study of existing options, this work sets the requirements for the application. It discusses problems and tries to find possible solutions. Character recognition is an important part. The work describes chosen solutions and their implementations. It ends by demonstrating achieved results and discussing options for further development of the system.
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.
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.
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.
Application for Visualization of Finite Automaton Structure
Polcer, Ondřej ; Horáček, Petr (referee) ; Zámečníková, Eva (advisor)
The goal of this thesis is to create an application that converts text form of a finite state machine to a state diagram. First, the code form of finite state machine syntax is transformed into the object form and complemented by additional data. The algorithm of finding appropriate placement for individual state of structure follows to make their transition clear and understandable with considering the complexity of a given finite state machine. The application creates a set of equivalent views in various form and delivers the appropriate information for easy interpretation of results.

National Repository of Grey Literature : 37 records found   1 - 10nextend  jump to record:
See also: similar author names
11 Horáček, Pavel
2 Horáček, Přemysl
Interested in being notified about new results for this query?
Subscribe to the RSS feed.