Mathematical systems theory

, Volume 28, Issue 3, pp 199–213

Pumping lemmas for the control language hierarchy

  • M. A. Palis
  • S. M. Shende
Article

DOI: 10.1007/BF01303055

Cite this article as:
Palis, M.A. & Shende, S.M. Math. Systems Theory (1995) 28: 199. doi:10.1007/BF01303055

Abstract

We investigate a progression of grammatically defined language families, thecontrol 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.

Copyright information

© Springer-Verlag New York Inc. 1995

Authors and Affiliations

  • M. A. Palis
    • 1
  • S. M. Shende
    • 2
  1. 1.Department of Electrical and Computer EngineeringNew Jersey Institute of TechnologyNewarkUSA
  2. 2.Department of Computer Science and EngineeringUniversity of NebraskaLincolnUSA

Personalised recommendations