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.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computational Theory and Mathematics