Associate languages and derivational complexity of formal grammars and languages

Etsuro Moriya

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

A criterion to measure derivational complexity of formal grammars and languages is proposed and discussed. That is, the associate language and the L-associate language are defined for a grammar such that the former represents all the valid derivations and the latter represents all the valid leftmost derivations. It is shown that for any phrase\3-structure grammar, the associate language is a contex\3-sensitive language and the L\3-associate language is a context\3-free language. Necessary and sufficient conditions for an associate language to be a regular set and to be a context\3-free language are found. The idea in the above necessary and sufficient conditions is extended to the notion of "rank≓ for a measure of derivational complexity of context\3-free grammars and languages. It is shown that for each nonnegative integer k, there exists a context\3-free language whose rank is k. The paper also includes a few solvable decision problems concerning derivational complexity of grammars.

Original languageEnglish
Pages (from-to)139-162
Number of pages24
JournalInformation and control
Volume22
Issue number2
DOIs
Publication statusPublished - 1973
Externally publishedYes

Fingerprint

Grammar
Language
Valid
Necessary Conditions
Regular Sets
Complexity Measure
Sufficient Conditions
Decision problem
Non-negative
Integer
Context

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Associate languages and derivational complexity of formal grammars and languages. / Moriya, Etsuro.

In: Information and control, Vol. 22, No. 2, 1973, p. 139-162.

Research output: Contribution to journalArticle

@article{c8508895e0ea4d69948bc24e9835f5b9,
title = "Associate languages and derivational complexity of formal grammars and languages",
abstract = "A criterion to measure derivational complexity of formal grammars and languages is proposed and discussed. That is, the associate language and the L-associate language are defined for a grammar such that the former represents all the valid derivations and the latter represents all the valid leftmost derivations. It is shown that for any phrase\3-structure grammar, the associate language is a contex\3-sensitive language and the L\3-associate language is a context\3-free language. Necessary and sufficient conditions for an associate language to be a regular set and to be a context\3-free language are found. The idea in the above necessary and sufficient conditions is extended to the notion of {"}rank≓ for a measure of derivational complexity of context\3-free grammars and languages. It is shown that for each nonnegative integer k, there exists a context\3-free language whose rank is k. The paper also includes a few solvable decision problems concerning derivational complexity of grammars.",
author = "Etsuro Moriya",
year = "1973",
doi = "10.1016/S0019-9958(73)90237-4",
language = "English",
volume = "22",
pages = "139--162",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "2",

}

TY - JOUR

T1 - Associate languages and derivational complexity of formal grammars and languages

AU - Moriya, Etsuro

PY - 1973

Y1 - 1973

N2 - A criterion to measure derivational complexity of formal grammars and languages is proposed and discussed. That is, the associate language and the L-associate language are defined for a grammar such that the former represents all the valid derivations and the latter represents all the valid leftmost derivations. It is shown that for any phrase\3-structure grammar, the associate language is a contex\3-sensitive language and the L\3-associate language is a context\3-free language. Necessary and sufficient conditions for an associate language to be a regular set and to be a context\3-free language are found. The idea in the above necessary and sufficient conditions is extended to the notion of "rank≓ for a measure of derivational complexity of context\3-free grammars and languages. It is shown that for each nonnegative integer k, there exists a context\3-free language whose rank is k. The paper also includes a few solvable decision problems concerning derivational complexity of grammars.

AB - A criterion to measure derivational complexity of formal grammars and languages is proposed and discussed. That is, the associate language and the L-associate language are defined for a grammar such that the former represents all the valid derivations and the latter represents all the valid leftmost derivations. It is shown that for any phrase\3-structure grammar, the associate language is a contex\3-sensitive language and the L\3-associate language is a context\3-free language. Necessary and sufficient conditions for an associate language to be a regular set and to be a context\3-free language are found. The idea in the above necessary and sufficient conditions is extended to the notion of "rank≓ for a measure of derivational complexity of context\3-free grammars and languages. It is shown that for each nonnegative integer k, there exists a context\3-free language whose rank is k. The paper also includes a few solvable decision problems concerning derivational complexity of grammars.

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

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

U2 - 10.1016/S0019-9958(73)90237-4

DO - 10.1016/S0019-9958(73)90237-4

M3 - Article

VL - 22

SP - 139

EP - 162

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 2

ER -