Result Details
Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems
Vrábel Lukáš, Ing.
Zemek Petr, Ing., Ph.D., DIFS (FIT)
In this paper, we address several open problems concerning pure grammar systems (pGSs) and their controlled versions. More specifically, we prove the following four results. (I) Regular-controlled pGSs having a single component define the family of regular languages. (II) pGSs having two components controlled by infinite regular languages define the family of recursively enumerable languages. (III) Regular-controlled pGSs without any erasing rules define the family of regular languages not containing the empty string. (IV) pGSs define a proper subfamily of the family of regular languages.
formal languages, pure grammar systems, controlled leftmost derivations, regular languages, erasing rules
@article{BUT111482,
author="Alexandr {Meduna} and Lukáš {Vrábel} and Petr {Zemek}",
title="Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems",
journal="INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS",
year="2014",
volume="91",
number="6",
pages="1156--1169",
doi="10.1080/00207160.2013.829214",
issn="0020-7160",
url="http://www.tandfonline.com/doi/abs/10.1080/00207160.2013.829214"
}
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
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
V3C - Visual Computing Competence Center, TAČR, Centra kompetence, TE01020415, start: 2012-05-01, end: 2019-12-31, completed