Journal article

MEDUNA Alexander. Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. Acta Cybernetica. 2004, vol. 2004, no. 16, pp. 385-397. ISSN 0324-721X.
Publication language:english
Original title:Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity
Title (cs):Dvousměrné metalineární PC gramatické systémy.
Pages:385-397
Book:Acta Informatica
Place:Szeged, HU
Year:2004
Journal:Acta Cybernetica, Vol. 2004, No. 16, US
ISSN:0324-721X
Publisher:Szegedi Tudomanyegyetem
Keywords
two-way metalinear PC grammar systems
Annotation
A discussion of two-way metalinear PC grammar systems and their descriptional complexity.
Abstract
Besides a derivation step and a communication step, a two-way PC grammar sytem 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, \Gamma, with two metalinear componets in a very economical way. Indeed, \Gamma's master has only three nonterminals and one communication production; furthermore, it produces all sentential forms with no more than two occurances of nonterminals. In addition, during every computation, \Gamma makes a single communication step. Some variants of two-way PC grammar systems are discussed in the conclusion of the paper.
BibTeX:
@ARTICLE{
   author = {Alexander Meduna},
   title = {Two-Way Metalinear PC Grammar Systems and Their
	Descriptional Complexity},
   pages = {385--397},
   booktitle = {Acta Informatica},
   journal = {Acta Cybernetica},
   volume = {2004},
   number = {16},
   year = {2004},
   location = {Szeged, HU},
   publisher = {Szegedi Tudomanyegyetem},
   ISSN = {0324-721X},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=7341}
}

Your IPv4 address: 54.81.110.114
Switch to IPv6 connection

DNSSEC [dnssec]