|
| |
|
|
Deep Syntax-Directed Translation
Senko, Jozef ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis is a continuation of my bachelor thesis, which is dedicated to syntax analysis based on deep pushdown automata. In theorical part of this thesis is defined everything fundamental for this work, for example deep syntax-directed translation, pushdown automata, deep pushdown automata, finite transducer and deep pushdown transducer. The second part of this thesis is dedicated to the educational program for students of IFJ. In this part is defined strucure of this program and its parts. All part of program are analyzed from a theoretical and practical point of view.
|
|
|
Modified Pushdown Automata
Hromádka, David ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work introduces limited Hromádka's automata as an extension of classical pushdown automata. This extension means that the automaton is able to create new pushdowns, insert input symbols into them, join them and compare with the input string in run time. The number of such pushdowns is limited by choosen constant n . This work also describes the implementation of the application, that realizes the activity of this automata and is looking for the sequence of derivational steps, by which the automaton accepts the input string.
|
|
|
Mobile Agents in Wireless Sensor Networks
Spáčil, Pavel ; Kočí, Radek (referee) ; Zbořil, František (advisor)
The aim of this work is to describe platform's concept and interpreter's implementation for mobile agents in wireless sensor networks. The reader will meet with theoretic and practical respect - he will obtain information about simple operating system TinyOS used for Motes' programming, about nesC language and about intelligent agents. Then he will meet with agents' language ALLL. Its semantic is illustrated on clear examples. The platform's concept and the concrete ALLL interpreter implementation will be described. Some examples with detailed description mustn't be missing at the end.
|
|
|
Semi-Parallel Deep Pushdown Transducers and Their Applications
Putala, Marek ; Dolejška, Daniel (referee) ; Meduna, Alexandr (advisor)
The goal of this work was to become familiar with deep stack automata and, based on the acquired knowledge, to further design, formally define and implement a partially parallel deep stack transducer. It is an extension of deep stack transducer that is capable of accessing non-terminal symbols simultaneously on the stack in one step. With a suitably chosen configuration in the form of rules, they can process the input string with fewer transitions and therefore have a higher speed compared to deep stack transducer.
|
|
| |
|
|
The Pushdown Automaton Simulator
Graizely, Martin ; Blatný, Petr (referee) ; Bidlo, Radek (advisor)
Visualization often helps with the understanding and allows for a quicker grasp of the problem. This work is aimed on implementation of pushdown automaton simulator. The purpose of the application is to ease understanding of such abstract machine and its abilities, by providing visual design and possibility of algorithm's interactive animation.
|
|
|
New Versions of Pushdown Automata
Genčúrová, Ľubica ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis investigates multi pushdown automata and introduces their new modifications based on deep pushdown. The first modification is Input driven multi deep pushdown automata, which has several deep pushdown lists and the current input symbol determines whether the automaton performs a push operation, a pop operation, an expansion operation or does not touch the stack. The second introduced modification is Regulated pushdown automata by deep pushdown. In addition to ordinary pushdowns, this version contains deep pushdown, which is used to generate the control language. This thesis proves, that the acceptance power of the described variants is equal to the accepting power of Turing machines. This thesis also contains view on program realisation of theoretical models, which were described in the theoretical part and introduces a library for the syntax analysis, which is based on it.
|
|
|
Predictive Parsing with Deep Pushdowns
Viktorin, Jiří ; Blatný, Petr (referee) ; Meduna, Alexandr (advisor)
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep pushdown automata expand a pushdown symbol in a depth defined by a rule. Deep pushdown expands a non-terminal in the deep defined in the rule and this non-terminal need not be on the top of pushdown.
|
|
|
Modified Pushdown Automata
Hromádka, David ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work introduces limited Hromádka's automata as an extension of classical pushdown automata. This extension means that the automaton is able to create new pushdowns, insert input symbols into them, join them and compare with the input string in run time. The number of such pushdowns is limited by choosen constant n . This work also describes the implementation of the application, that realizes the activity of this automata and is looking for the sequence of derivational steps, by which the automaton accepts the input string.
|
guest ::
