Detail publikace

Two-Way Linear PC Grammar Systems

KALÁB, P.

Originální název

Two-Way Linear PC Grammar Systems

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

Besides derivation and communication steps, a two-way PC grammar system can make a reduction step during which it reduces the right-hand side of a context-free production to its left hand-side. This paper proves that every non-unary recursively enumerable language is defined by a centralized two-way grammar system, Γ, with five components in a very economical way. Indeed, Γ's master has only three nonterminals and one communication production; furthermore, it produces all sentential forms with no more than two occurrences of nonterminals. In addition, during every computation, Γ makes a single communication step.

Klíčová slova

Context-free grammar, left-linear grammar, right-linear grammar, grammar system, communication step, two-way PC grammar systems, derivation, production, sentential form, nonterminal, terminal.

Autoři

KALÁB, P.

Rok RIV

2005

Vydáno

14. 5. 2005

Místo

Ostrava

ISBN

80-86840-09-3

Kniha

Proceedings of 8th Spring International Conference ISIM'05 Information Systems Implementation and Modelling

Edice

1st edition

Strany od

87

Strany do

94

Strany počet

8

BibTex

@inproceedings{BUT21493,
  author="Petr {Kaláb}",
  title="Two-Way Linear PC Grammar Systems",
  booktitle="Proceedings of 8th Spring International Conference ISIM'05 Information Systems Implementation and Modelling",
  year="2005",
  series="1st edition",
  pages="87--94",
  address="Ostrava",
  isbn="80-86840-09-3"
}