Thesis Details

New Parallel and Regulated Automata and Grammars

Ph.D. Thesis Student: Kučera Jiří Academic Year: 2021/2022 Supervisor: Meduna Alexander, prof. RNDr., CSc.
Czech title
Nové Paralelní a Regulované Automaty a Gramatiky
Language
English
Abstract

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.

Keywords

formal language theory, 0L languages, pure context-free languages, recursively enumerable languages, finite index, infinite hierarchy, automata, pushdown, pushdown automata, automata systems, deep pushdown automata, state-synchronized automata systems, unlimited deep pushdown automata, grammars, pure grammars, jumping grammars, jumping pure grammars, rewriting, parallel rewriting, jumping rewriting, rewriting systems, #-rewriting systems, k#$-rewriting systems

Department
Degree Programme
Status
delivered
Back to top