Upper bounds on recognition of a hierarchy of non-context-free languages
type: Item
instance of: scholarly article
title: Upper bounds on recognition of a hierarchy of non-context-free languages
zbMATH Open document ID: 0761.68051
DOI: 10.1016/0304-3975(92)90005-Z
author: Michael A. Palis
author: Sunil Shende
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 65318
zbMATH Keywords: computational linguistics
zbMATH Keywords: grammatical models for natural language
zbMATH Keywords: control grammars
zbMATH Keywords: control language hierarchy
MaRDI profile type: Publication
cites work: Alternation
cites work: Studies in abstract families of languages
cites work: Q4198075
cites work: Description of developmental languages using recurrence systems
cites work: Q5592246
cites work: Simple matrix languages
cites work: A hierarchy between context-free and context-sensitive languages
cites work: A geometric hierarchy of languages
cites work: Programmed Grammars and Classes of Formal Languages
cites work: On uniform circuit complexity
cites work: Tree-size bounded alternation
cites work: Space-bounded hierarchies and probabilistic computations
cites work: Matrix grammars with a leftmost restriction
cites work: The polynomial-time hierarchy
full work available at URL: 0304-3975(92)90005-z
OpenAlex ID: W1992315343
description: scientific article; zbMATH DE number 65318