A geometric hierarchy beyond context-free languages
type: Item
instance of: scholarly article
title: A geometric hierarchy beyond context-free languages
zbMATH Open document ID: 0754.68070
DOI: 10.1016/0304-3975(92)90124-X
author: David Weir
published in: Theoretical Computer Science
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 95806
zbMATH Keywords: labelled distinguished grammars
zbMATH Keywords: computational linguistics
zbMATH Keywords: progression of automata
zbMATH Keywords: language hierarchy
zbMATH Keywords: control grammars
MaRDI profile type: Publication
cites work: Indexed Grammars—An Extension of Context-Free Grammars
cites work: Pushdown tree automata
cites work: Tree adjunct grammars
cites work: A geometric hierarchy of languages
cites work: Pumping lemmas for the control language hierarchy
cites work: Upper bounds on recognition of a hierarchy of non-context-free languages
cites work: The complexity of the membership problem for some extensions of context-free languagest†
cites work: Linear indexed languages
cites work: Iterated linear control and iterated one-turn pushdowns
Recommended article: Q3979274
Recommended article: Decidability of Geometricity of Regular Languages
Recommended article: Geometric representations for minimalist grammars
Recommended article: Geometricity of Binary Regular Languages
Recommended article: A TREE-HEIGHT HIERARCHY OF CONTEXT-FREE LANGUAGES
Recommended article: Upper bounds on recognition of a hierarchy of non-context-free languages
Recommended article: Geometrical closure of binary \(V_{3/2}\) languages
Recommended article: A geometrical representation of the basic laws of categorial grammar
Recommended article: Geometrically closed positive varieties of languages
Recommended article: The Polytope of Context-Free Grammar Constraints
description: scientific article; zbMATH DE number 95806