A geometric hierarchy of languages
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3386920 (Why is no real title available?)
- Phrase structure languages, finite machines, and channel capacity
Cited in
(21)- On input-revolving deterministic and nondeterministic finite automata
- The OI-hierarchy is closed under control
- Tree transducers, L systems, and two-way machines
- Upper bounds on recognition of a hierarchy of non-context-free languages
- A geometric hierarchy beyond context-free languages
- Control sets on context-free grammar forms
- One way finite visit automata
- Multipass precedence analysis
- Global index grammars and descriptive power
- Even linear simple matrix languages: formal language properties and grammatical inference.
- Weighted iterated linear control
- Storage products and linear control of derivations
- Decision problems on path-controlled grammars
- HYBRID EXTENDED FINITE AUTOMATA
- Iterated linear control and iterated one-turn pushdowns
- scientific article; zbMATH DE number 3602690 (Why is no real title available?)
- The complexity of the membership problem for some extensions of context-free languagest†
- Pumping lemmas for the control language hierarchy
- Gaining Power by Input Operations: Finite Automata and Beyond
- Basic tree transducers
- Linear indexed languages
This page was built for publication: A geometric hierarchy of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1212799)
