On semi-conditional grammars with productions having either forbidding or permitting conditions

Meduna Alexander and Gopalaratnam A.: On semi-conditional grammars with productions having either forbidding or permitting conditions. In: Acta cybernetica, (11) 4. pp. 307-323. (1994)

[thumbnail of cybernetica_011_numb_004_307-323.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_011_numb_004_307-323.pdf

Download (905kB) | Preview

Abstract

This paper simplifies semi-conditional grammars so their productions have no more than one associated word-either a permitting condition or a forbidding condition. It is demonstrated that this simplification does not decrease the power of semi-conditional grammars.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1994
Volume: 11
Number: 4
ISSN: 0324-721X
Page Range: pp. 307-323
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38498/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 323. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 13. 11:46
URI: http://acta.bibl.u-szeged.hu/id/eprint/12535

Actions (login required)

View Item View Item