Result Details
Tree-Controlled Grammars with Restrictions Placed upon Cuts and Paths
Meduna Alexandr, prof. RNDr., CSc., DIFS (FIT)
First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths restricted by control languages. It demonstrates that if the control languages are regular, these grammars generate the family of context-free languages. Then, in a similar way, the paper introduces tree-controlled grammars with derivation-tree cuts restricted by control languages. It proves that if the cuts are restricted by regular languages, these grammars generate the family of recursively enumerable languages. In addition, it places a binary-relation-based restriction upon these grammars and demonstrate that this adi- tional restriction does not affect the generative power of these grammars.
context-free grammars, tree-controlled grammars, restricted derivation trees,paths, cuts, language families
@article{BUT91444,
author="Jiří {Koutný} and Alexandr {Meduna}",
title="Tree-Controlled Grammars with Restrictions Placed upon Cuts and Paths",
journal="KYBERNETIKA",
year="2012",
volume="48",
number="1",
pages="165--175",
issn="0023-5954",
url="http://www.kybernetika.cz/content/2012/1/165"
}
Context-free languages and pushdown automata, MŠMT, KONTAKT, MEB041003, start: 2010-01-01, end: 2011-12-31, completed
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems, GACR, Doktorské granty, GD102/09/H042, start: 2009-01-30, end: 2012-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running