|
|
Parsing Based on Deep Pushdown Automata Systems
Šoustar, Jakub ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis investigates deep pushdown automata and introduces their modification called controlled deep pushdown automata. Distributed deep pushdown automata systems and parallel communicating deep pushdown automata systems are described. Their accepting power and properties are investigated and several variants are introduced. This thesis proves that the accepting power of one such variant of parallel communicating deep pushdown automata systems is equal to the accepting power of Turing machines. A method for syntactical analysis based on the previously introduced automata systems is described.
|
|
|
Automata Systems
Kaščák, Andrej ; Rychnovský, Lukáš (referee) ; Meduna, Alexandr (advisor)
This bachelor thesis deals with automata systems, especially the ones, which are defined as state and or rule controlled parallel automata systems. Their components are finite automata systems. Definitions are retrieved from analyzing and researching already existing automata systems. In the thesis, a comparison of these systems is made with systems defined a priori. The thesis also analyzes first features of these systems, and second a possibilities of transforming the state controlled parallel automata system into the rule controlled parallel automata system and vice versa.
|
|
|
Parsing Based on Deep Pushdown Automata Systems
Šoustar, Jakub ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis investigates deep pushdown automata and introduces their modification called controlled deep pushdown automata. Distributed deep pushdown automata systems and parallel communicating deep pushdown automata systems are described. Their accepting power and properties are investigated and several variants are introduced. This thesis proves that the accepting power of one such variant of parallel communicating deep pushdown automata systems is equal to the accepting power of Turing machines. A method for syntactical analysis based on the previously introduced automata systems is described.
|
|
|
Automata Systems
Kaščák, Andrej ; Rychnovský, Lukáš (referee) ; Meduna, Alexandr (advisor)
This bachelor thesis deals with automata systems, especially the ones, which are defined as state and or rule controlled parallel automata systems. Their components are finite automata systems. Definitions are retrieved from analyzing and researching already existing automata systems. In the thesis, a comparison of these systems is made with systems defined a priori. The thesis also analyzes first features of these systems, and second a possibilities of transforming the state controlled parallel automata system into the rule controlled parallel automata system and vice versa.
|
guest ::
