Detail publikace

Controlled Pure Grammar Systems

Originální název

Controlled Pure Grammar Systems

Anglický název

Controlled Pure Grammar Systems

Jazyk

en

Originální abstrakt

This paper discusses grammar systems that have only terminals, work in the leftmost way, and generate their languages under the regulation by control languages over rule labels. It establishes three results concerning their generative power. First, without any control languages, these systems are not even able to generate all context-free languages. Second, with regular control languages, these systems, having no more than two components, characterize the family of recursively enumerable languages. Finally, with control languages that are themselves generated by regular-controlled context-free grammars, these systems over unary alphabets generate nothing but regular languages. In its introductory section, the paper gives a motivation for introducing these systems, and in the concluding section, it formulates several open problems.

Anglický abstrakt

This paper discusses grammar systems that have only terminals, work in the leftmost way, and generate their languages under the regulation by control languages over rule labels. It establishes three results concerning their generative power. First, without any control languages, these systems are not even able to generate all context-free languages. Second, with regular control languages, these systems, having no more than two components, characterize the family of recursively enumerable languages. Finally, with control languages that are themselves generated by regular-controlled context-free grammars, these systems over unary alphabets generate nothing but regular languages. In its introductory section, the paper gives a motivation for introducing these systems, and in the concluding section, it formulates several open problems.

BibTex


@article{BUT96924,
  author="Alexandr {Meduna} and Petr {Zemek}",
  title="Controlled Pure Grammar Systems",
  annote="This paper discusses grammar systems that have only terminals, work in the
leftmost way, and generate their languages under the regulation by control
languages over rule labels. It establishes three results concerning their
generative power. First, without any control languages, these systems are not
even able to generate all context-free languages. Second, with regular control
languages, these systems, having no more than two components, characterize the
family of recursively enumerable languages. Finally, with control languages that
are themselves generated by regular-controlled context-free grammars, these
systems over unary alphabets generate nothing but regular languages. In its
introductory section, the paper gives a motivation for introducing these systems,
and in the concluding section, it formulates several open problems.",
  address="NEUVEDEN",
  chapter="96924",
  edition="NEUVEDEN",
  howpublished="online",
  institution="NEUVEDEN",
  number="14",
  volume="18",
  year="2012",
  month="october",
  pages="2024--2040",
  publisher="NEUVEDEN",
  type="journal article in Web of Science"
}