|
Parsing Based on Grammar and Automata Systems
Šoustar, Jakub ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focusing especially on impacts of nondeterminism in individual components on the whole system. Also it introduces a proposal of algorithm for converting some parallel communicating grammar systems to parallel communicating pushdown automata systems. The gained knowledge is used to design and implement parsing method.
|
|
Systems of Formal Models with Applications
Čermák, Martin ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
This paper introduces and discusses automata systems as a new way for formal languages processing. In the text there are four models described. The first model works on sequential mode. At one computation step only one of components works. The second one works on semi-parallel mode. At the one computation step either one or all the components of the automata system work. In the last two models each component of the automata system has its own input string. The computation step of each component is influenced by their states, or used rules. The state, or used rule of the components of automata system can block or unblock some or all automata of the system.
|
|
New Versions of Automata and Grammar Systems
Lichota, Lukáš ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This work deals with the modification of classical grammar systems with context-free base and defines new, modified linear grammar systems with linear grammar base. Also it deals with modification in automata systems, where each automaton is generative as strong as linear grammar, which is satisfied with the usage of one-turn push-down automata. This thesis also contains view on program realisation of theoretical models, which were described in theoretical part and introduces two programs for syntax analysis built based on it.
|
|
New Versions of Automata and Grammar Systems
Lichota, Lukáš ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This work deals with the modification of classical grammar systems with context-free base and defines new, modified linear grammar systems with linear grammar base. Also it deals with modification in automata systems, where each automaton is generative as strong as linear grammar, which is satisfied with the usage of one-turn push-down automata. This thesis also contains view on program realisation of theoretical models, which were described in theoretical part and introduces two programs for syntax analysis built based on it.
|
|
Systems of Formal Models with Applications
Čermák, Martin ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
This paper introduces and discusses automata systems as a new way for formal languages processing. In the text there are four models described. The first model works on sequential mode. At one computation step only one of components works. The second one works on semi-parallel mode. At the one computation step either one or all the components of the automata system work. In the last two models each component of the automata system has its own input string. The computation step of each component is influenced by their states, or used rules. The state, or used rule of the components of automata system can block or unblock some or all automata of the system.
|
|
Parsing Based on Grammar and Automata Systems
Šoustar, Jakub ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focusing especially on impacts of nondeterminism in individual components on the whole system. Also it introduces a proposal of algorithm for converting some parallel communicating grammar systems to parallel communicating pushdown automata systems. The gained knowledge is used to design and implement parsing method.
|