Detail publikace

Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems

MEDUNA, A. VRÁBEL, L. ZEMEK, P.

Originální název

Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

formal languages, pure grammar systems, controlled leftmost derivations, regular languages, erasing rules

Autoři

MEDUNA, A.; VRÁBEL, L.; ZEMEK, P.

Rok RIV

2014

Vydáno

18. 8. 2014

ISSN

0020-7160

Periodikum

International Journal of Computer Mathematics

Ročník

91

Číslo

6

Stát

Spojené království Velké Británie a Severního Irska

Strany od

1156

Strany do

1169

Strany počet

14

URL

http://www.tandfonline.com/doi/abs/10.1080/00207160.2013.829214

BibTex

@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"
}