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

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.

Elmentve itt :
Bibliográfiai részletek
Szerzők: Meduna Alexander
Gopalaratnam A.
Dokumentumtípus: Cikk
Megjelent: 1994
Sorozat:Acta cybernetica 11 No. 4
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12535
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:307-323
ISSN:0324-721X