Pumping lemmas for the control language hierarchy

M. A. Palis; S. M. Shende

doi:10.1007/BF01303055

Pumping lemmas for the control language hierarchy

Research output: Contribution to journal › Article › peer-review

Abstract

We investigate a progression of grammatically defined language families, the control language hierarchy. This hierarchy has been studied recently from the perspective of providing a linguistic framework for natural language syntax. We exhibit a progression of pumping lemmas, one for each family in the hierarchy, thereby showing that the hierarchy is strictly separable.

Original language	American English
Pages (from-to)	199-213
Number of pages	15
Journal	Mathematical Systems Theory
Volume	28
Issue number	3
DOIs	https://doi.org/10.1007/BF01303055
State	Published - May 1995
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
General Mathematics
Computational Theory and Mathematics

Access to Document

10.1007/BF01303055

Cite this

@article{30858347613246ccb40993f3c5092c53,

title = "Pumping lemmas for the control language hierarchy",

abstract = "We investigate a progression of grammatically defined language families, the control language hierarchy. This hierarchy has been studied recently from the perspective of providing a linguistic framework for natural language syntax. We exhibit a progression of pumping lemmas, one for each family in the hierarchy, thereby showing that the hierarchy is strictly separable.",

author = "Palis, \{M. A.\} and Shende, \{S. M.\}",

year = "1995",

month = may,

doi = "10.1007/BF01303055",

language = "American English",

volume = "28",

pages = "199--213",

journal = "Mathematical Systems Theory",

issn = "0025-5661",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Pumping lemmas for the control language hierarchy

AU - Palis, M. A.

AU - Shende, S. M.

PY - 1995/5

Y1 - 1995/5

N2 - We investigate a progression of grammatically defined language families, the control language hierarchy. This hierarchy has been studied recently from the perspective of providing a linguistic framework for natural language syntax. We exhibit a progression of pumping lemmas, one for each family in the hierarchy, thereby showing that the hierarchy is strictly separable.

AB - We investigate a progression of grammatically defined language families, the control language hierarchy. This hierarchy has been studied recently from the perspective of providing a linguistic framework for natural language syntax. We exhibit a progression of pumping lemmas, one for each family in the hierarchy, thereby showing that the hierarchy is strictly separable.

UR - https://www.scopus.com/pages/publications/0040536794

UR - https://www.scopus.com/pages/publications/0040536794#tab=citedBy

U2 - 10.1007/BF01303055

DO - 10.1007/BF01303055

M3 - Article

SN - 0025-5661

VL - 28

SP - 199

EP - 213

JO - Mathematical Systems Theory

JF - Mathematical Systems Theory

IS - 3

ER -

Pumping lemmas for the control language hierarchy

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this