A geometric hierarchy of languages

DOI10.1016/S0022-0000(74)80052-8zbMath0294.68029WikidataQ29011872 ScholiaQ29011872MaRDI QIDQ1212799

Nabil A. Khabbaz

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (21)

The OI-hierarchy is closed under control ⋮ Pumping lemmas for the control language hierarchy ⋮ Unnamed Item ⋮ Tree transducers, L systems, and two-way machines ⋮ Multipass precedence analysis ⋮ HYBRID EXTENDED FINITE AUTOMATA ⋮ Weighted iterated linear control ⋮ Iterated linear control and iterated one-turn pushdowns ⋮ Upper bounds on recognition of a hierarchy of non-context-free languages ⋮ A geometric hierarchy beyond context-free languages ⋮ Storage products and linear control of derivations ⋮ Global index grammars and descriptive power ⋮ Basic tree transducers ⋮ Control sets on context-free grammar forms ⋮ One way finite visit automata ⋮ Gaining Power by Input Operations: Finite Automata and Beyond ⋮ The complexity of the membership problem for some extensions of context-free languagest† ⋮ DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS ⋮ On input-revolving deterministic and nondeterministic finite automata ⋮ Linear indexed languages ⋮ Even linear simple matrix languages: formal language properties and grammatical inference.

Cites Work

• Phrase structure languages, finite machines, and channel capacity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A geometric hierarchy of languages