|
|
New Parallel and Regulated Automata and Grammars
Kučera, Jiří ; Průša, Daniel (oponent) ; Sawa, Zdeněk (oponent) ; Meduna, Alexandr (vedoucí práce)
This thesis introduces and studies four new language models with focus on regulation and parallelism in automata and grammars. First, state-synchronized automata systems , present systems consisting of a finite number of pushdown automata controlled by words of a control language over a set of states. Second, unlimited deep pushdown automata , are a modification of deep pushdown automata with no restrictions imposed on the depth of expansion on the pushdown. Third, jumping pure grammars , introduces jumping grammars with no nonterminal symbols. The last one, k#$-rewriting systems , extends #-rewriting systems with additional pushdown memory. The contents of this thesis are divided into three parts. The first part outlines the motivation for introduction of the studied language models and puts them into the context of related formal language theory areas. Furthermore, it gives an overview of the structure of the thesis, reviews fundamental notions of formal language theory and gives a survey of current knowledge related to the subject of research. The second part presents the core of this thesis. Here, formal definitions of all newly introduced language models are given and their expressive power is studied. Finally, this thesis is concluded with a summary of achieved theoretical results as well as related open problem areas, and an outline of the possibilities for further research along with a sketch of possible applications.
|
|
| |
|
|
Final Sentential Forms and Their Applications
Kožár, Tomáš ; Kövári, Adam (oponent) ; Meduna, Alexandr (vedoucí práce)
Context-free grammars are one of the most used formal models in formal language theory. They have many useful applications, but for many applications, they lack expressive power. We introduce a final language F . When a sentential form of the context-free grammar G belongs to the F , it becomes a final sentential form. By the erasion of the nonterminals from the final sentential forms, we receive a language of G finalized by F , L(G,F) . We prove that for each recursively enumerable language L , there exists context-free grammar G , such that L = L(G,F) , with F = { w#reversal(w) | w is from {0,1}*}, where reversal(w) is a reversal of w . When a regular language is used as F , no increase in generative power compared to context-free grammars is achieved. We show multiple applications of the final sentential forms in the fields of the linguistics and bioinformatics.
|
|
|
Final Sentential Forms and Their Applications
Kožár, Tomáš ; Kövári, Adam (oponent) ; Meduna, Alexandr (vedoucí práce)
Context-free grammars are one of the most used formal models in formal language theory. They have many useful applications, but for many applications, they lack expressive power. We introduce a final language F . When a sentential form of the context-free grammar G belongs to the F , it becomes a final sentential form. By the erasion of the nonterminals from the final sentential forms, we receive a language of G finalized by F , L(G,F) . We prove that for each recursively enumerable language L , there exists context-free grammar G , such that L = L(G,F) , with F = { w#reversal(w) | w is from {0,1}*}, where reversal(w) is a reversal of w . When a regular language is used as F , no increase in generative power compared to context-free grammars is achieved. We show multiple applications of the final sentential forms in the fields of the linguistics and bioinformatics.
|
|
|
New Parallel and Regulated Automata and Grammars
Kučera, Jiří ; Průša, Daniel (oponent) ; Sawa, Zdeněk (oponent) ; Meduna, Alexandr (vedoucí práce)
This thesis introduces and studies four new language models with focus on regulation and parallelism in automata and grammars. First, state-synchronized automata systems , present systems consisting of a finite number of pushdown automata controlled by words of a control language over a set of states. Second, unlimited deep pushdown automata , are a modification of deep pushdown automata with no restrictions imposed on the depth of expansion on the pushdown. Third, jumping pure grammars , introduces jumping grammars with no nonterminal symbols. The last one, k#$-rewriting systems , extends #-rewriting systems with additional pushdown memory. The contents of this thesis are divided into three parts. The first part outlines the motivation for introduction of the studied language models and puts them into the context of related formal language theory areas. Furthermore, it gives an overview of the structure of the thesis, reviews fundamental notions of formal language theory and gives a survey of current knowledge related to the subject of research. The second part presents the core of this thesis. Here, formal definitions of all newly introduced language models are given and their expressive power is studied. Finally, this thesis is concluded with a summary of achieved theoretical results as well as related open problem areas, and an outline of the possibilities for further research along with a sketch of possible applications.
|
|
| |
|
| |
host ::
RSS.