Publication Details
Two-way PC Grammar Systems Based on Regular Grammars
Context-free grammar, left-linear grammar, right-linear grammar, grammar system, communication step, two-way PC grammar systems, derivation, production, sentential form, nonterminal, terminal
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 three 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. Some variants of two-way PC grammar system are discussed in the conclusion of this paper.
@INPROCEEDINGS{FITPUB7420, author = "Petr Kal\'{a}b", title = "Two-way PC Grammar Systems Based on Regular Grammars", pages = "111--118", booktitle = "Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modeling", series = "1st edition", year = 2004, location = "Ostrava, CZ", ISBN = "80-85988-99-2", language = "english", url = "https://www.fit.vut.cz/research/publication/7420" }