Publication Details

Two-Way Linear PC Grammar Systems and Their Descriptional Complexity

KALÁB, P. Two-Way Linear PC Grammar Systems and Their Descriptional Complexity. In Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Publishing house of Brno University of Technology VUTIUM, 2005. p. 546-550. ISBN: 80-214-2890-2.
Czech title
Dvousměrné lineární PC gramatické systémy a jejich popisná složitost
Type
conference paper
Language
English
Authors
Kaláb Petr, Ing.
Keywords

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

Abstract

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.

Published
2005
Pages
546–550
Proceedings
Proceedings of the 11th Conference Student EEICT 2005
Series
Volume 3
Conference
STUDENT EEICT 2005, Brno, CZ
ISBN
80-214-2890-2
Publisher
Publishing house of Brno University of Technology VUTIUM
Place
Brno
BibTeX 
@inproceedings{BUT21492,
  author="Petr {Kaláb}",
  title="Two-Way Linear PC Grammar Systems and Their Descriptional Complexity",
  booktitle="Proceedings of the 11th Conference Student EEICT 2005",
  year="2005",
  series="Volume 3",
  pages="546--550",
  publisher="Publishing house of Brno University of Technology VUTIUM",
  address="Brno",
  isbn="80-214-2890-2"
}
Back to top