Thesis Details
Formal Systems Based on Automata and Grammars
The present thesis continues with study of grammar and automata systems. First of all, it deals with regularly controlled CD grammar systems with phrase-structure grammars as components. Into these systems, three new derivation restrictions are placed and their effect on the generative power of these systems are investigated. Thereafter, this thesis defines two automata counterparts of canonical multi-generative nonterminal and rule synchronized grammar systems, generating vectors of strings, and it shows that these investigated systems are equivalent. Furthermore, this thesis generalizes definitions of these systems and establishes fundamental hierarchy of n-languages (sets of n-tuples of strings). In relation with these mentioned systems, automaton-grammar translating systems based upon finite automaton and context-free grammar are introduced and investigated as a mechanism for direct translating. At the end, in this thesis introduced automata systems are used as the core of parse-method based upon n-path-restricted tree-controlled grammars.
automaton, grammar, automata system, grammar system, controlled rewriting, multi-generation, n-language
@phdthesis{FITPT362,
author = "Martin \v{C}erm\'{a}k",
type = "Ph.D. thesis",
title = "Formal Systems Based on Automata and Grammars",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2012,
location = "Brno, CZ",
language = "english",
url = "https://www.fit.vut.cz/study/phd-thesis/362/"
}