A note on the descriptional complexity of semi-conditional grammars

Fumiya Okubo

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

The descriptional complexity of semi-conditional grammars (SCG) has been presented. Semi-conditional grammars (SCG) are context-free grammars with a permitting and a forbidding condition associated to each production. The class of recursively enumerable languages is characterized by SCGs of degree with six conditional productions and seven non terminals. It is proved that the class of recursively enumerable languages is characterized by simple SCGs of degree with eight conditional productions and nine non terminals. Simple semi-conditional grammars of degree with erasing productions characterize the class of recursively enumerable languages and the classes of languages generated by simple semi-conditional grammars of degree and with erasing productions are included in the class of recursive languages.

Original languageEnglish
Pages (from-to)36-40
Number of pages5
JournalInformation Processing Letters
Volume110
Issue number1
DOIs
Publication statusPublished - Dec 1 2009

Fingerprint

Descriptional Complexity
Grammar
Recursively Enumerable Languages
Context free grammars
Context-free Grammar
Class

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

A note on the descriptional complexity of semi-conditional grammars. / Okubo, Fumiya.

In: Information Processing Letters, Vol. 110, No. 1, 01.12.2009, p. 36-40.

Research output: Contribution to journalArticle

@article{944b608e0bc6487d99568e2fcfb39253,
title = "A note on the descriptional complexity of semi-conditional grammars",
abstract = "The descriptional complexity of semi-conditional grammars (SCG) has been presented. Semi-conditional grammars (SCG) are context-free grammars with a permitting and a forbidding condition associated to each production. The class of recursively enumerable languages is characterized by SCGs of degree with six conditional productions and seven non terminals. It is proved that the class of recursively enumerable languages is characterized by simple SCGs of degree with eight conditional productions and nine non terminals. Simple semi-conditional grammars of degree with erasing productions characterize the class of recursively enumerable languages and the classes of languages generated by simple semi-conditional grammars of degree and with erasing productions are included in the class of recursive languages.",
author = "Fumiya Okubo",
year = "2009",
month = "12",
day = "1",
doi = "10.1016/j.ipl.2009.10.002",
language = "English",
volume = "110",
pages = "36--40",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - A note on the descriptional complexity of semi-conditional grammars

AU - Okubo, Fumiya

PY - 2009/12/1

Y1 - 2009/12/1

N2 - The descriptional complexity of semi-conditional grammars (SCG) has been presented. Semi-conditional grammars (SCG) are context-free grammars with a permitting and a forbidding condition associated to each production. The class of recursively enumerable languages is characterized by SCGs of degree with six conditional productions and seven non terminals. It is proved that the class of recursively enumerable languages is characterized by simple SCGs of degree with eight conditional productions and nine non terminals. Simple semi-conditional grammars of degree with erasing productions characterize the class of recursively enumerable languages and the classes of languages generated by simple semi-conditional grammars of degree and with erasing productions are included in the class of recursive languages.

AB - The descriptional complexity of semi-conditional grammars (SCG) has been presented. Semi-conditional grammars (SCG) are context-free grammars with a permitting and a forbidding condition associated to each production. The class of recursively enumerable languages is characterized by SCGs of degree with six conditional productions and seven non terminals. It is proved that the class of recursively enumerable languages is characterized by simple SCGs of degree with eight conditional productions and nine non terminals. Simple semi-conditional grammars of degree with erasing productions characterize the class of recursively enumerable languages and the classes of languages generated by simple semi-conditional grammars of degree and with erasing productions are included in the class of recursive languages.

UR - http://www.scopus.com/inward/record.url?scp=71049135981&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71049135981&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2009.10.002

DO - 10.1016/j.ipl.2009.10.002

M3 - Article

AN - SCOPUS:71049135981

VL - 110

SP - 36

EP - 40

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 1

ER -