Academic Journals Database
Disseminating quality controlled scientific knowledge

Formal Systems Based upon Automata and Grammars

Author(s): Martin Cermak

Journal: Information Sciences and Technologies Bulletin of the ACM Slovakia
ISSN 1338-1237

Volume: 4;
Issue: 4;
Start page: 7;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: grammar | automaton | grammar system | automata sys- tem | transducer | parsing

This work is based on my PhD thesis, which continueswith studying of grammar and automata systems. Firstof all, it deals with regularly controlled CD grammarsystems with phrase-structure grammars as components.Into these systems, three new derivation restrictions areplaced and their eect on the generative power of thesesystems are investigated. Thereafter, the thesis denestwo automata counterparts of canonical multi-generativenonterminal and rule synchronized grammar systems, gen-erating vectors of strings, and it shows that these inves-tigated systems are equivalent. Furthermore, the thesisgeneralizes denitions of these systems and establishesfundamental hierarchy of n-languages (sets of n-tuplesof strings). In relation with these mentioned systems,automaton-grammar translating systems based upon -nite automaton and context-free grammar are introducedand investigated as a mechanism for direct translating.At the end, in the thesis introduced automata systemsare used as the core of parse-method based uponrestricted tree-controlled grammars.
Save time & money - Smart Internet Solutions      Why do you need a reservation system?