Result Details
One-Sided Forbidding Grammars and Selective Substitution Grammars
Zemek Petr, Ing., Ph.D., DIFS (FIT)
In one-sided forbidding grammars, the set of rules is divided into the set of left forbidding rules and the set of right forbidding rules. A left forbidding rule can rewrite a nonterminal if each of its forbidding symbols is absent to the left of the rewritten symbol in the current sentential form while a right forbidding rule is applied analogically except that this absence is verified to the right. Apart from this, they work like ordinary forbidding grammars.
As its main result, the present paper proves that one-sided forbidding grammars are equivalent to selective substitution grammars. This equivalence is established in terms of grammars with and without erasing rules. Furthermore, the paper proves that one-sided forbidding grammars in which the set of left forbidding rules coincides with the set of right forbidding rules characterize the family of context-free languages. In the conclusion, the significance of the achieved results is discussed.
Formal language theory, regulated rewriting, one-sided forbidding grammars, selective substitution grammars, generative power
@article{BUT91446,
author="Alexandr {Meduna} and Petr {Zemek}",
title="One-Sided Forbidding Grammars and Selective Substitution Grammars",
journal="INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS",
year="2012",
volume="89",
number="5",
pages="586--596",
doi="10.1080/00207160.2011.642300",
issn="0020-7160",
url="http://www.tandfonline.com/doi/abs/10.1080/00207160.2011.642300"
}Centrum excelence IT4Innovations, MŠMT, Operační program Výzkum a vývoj pro inovace, ED1.1.00/02.0070, start: 2011-01-01, end: 2015-12-31, completed
Context-free languages and pushdown automata, MŠMT, KONTAKT, MEB041003, start: 2010-01-01, end: 2011-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