Meduna Alexander: Two-way metalinear PC grammar systems and their descriptional complexity. In: Acta cybernetica, (16) 3. pp. 385-397. (2004)
Preview |
Cikk, tanulmány, mű
Meduna_2004_ActaCybernetica.pdf Download (163kB) | Preview |
Abstract
Besides a derivation step and a communication step, 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 two metalinear 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 systems are discussed in the conclusion of this paper.
Item Type: | Article |
---|---|
Journal or Publication Title: | Acta cybernetica |
Date: | 2004 |
Volume: | 16 |
Number: | 3 |
ISSN: | 0324-721X |
Page Range: | pp. 385-397 |
Language: | English |
Place of Publication: | Szeged |
Related URLs: | http://acta.bibl.u-szeged.hu/38517/ |
Uncontrolled Keywords: | Számítástechnika, Nyelvészet - számítógép alkalmazása |
Additional Information: | Bibliogr.: p. 396-397. ; összefoglalás angol nyelven |
Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
Date Deposited: | 2016. Oct. 15. 12:25 |
Last Modified: | 2022. Jun. 15. 10:20 |
URI: | http://acta.bibl.u-szeged.hu/id/eprint/12729 |
Actions (login required)
![]() |
View Item |