Recommendations
Cites work
- scientific article; zbMATH DE number 3963215 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A geometric hierarchy of languages
- Control sets on grammars
- Indexed Grammars—An Extension of Context-Free Grammars
Cited in
(25)- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
- Indexed counter languages
- A language hierarchy of binary relations
- Grammars, derivation modes and properties of indexed and type-0 languages
- Self-embedding indexed grammars
- The OI-hierarchy is closed under control
- The equivalence of four extensions of context-free grammars
- A pumping lemma for flip-pushdown languages
- A descriptive characterisation of linear languages
- On bounded semilinear languages, counter machines, and finite-index ET0L
- On characterisation of language families in terms of inverse morphisms
- Basic tree transducers
- Storage products and linear control of derivations
- A geometric hierarchy beyond context-free languages
- Grammatical characterizations of NPDAs and VPDAs with counters
- Two applications of monoid actions to cross-sections
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- scientific article; zbMATH DE number 3963215 (Why is no real title available?)
- Iterated linear control and iterated one-turn pushdowns
- The structure of index sets and reduced indexed grammars
- Semilinearity of families of languages
- Gaining Power by Input Operations: Finite Automata and Beyond
- scientific article; zbMATH DE number 3878381 (Why is no real title available?)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
- Epsilon-reducible context-free languages and characterizations of indexed languages
This page was built for publication: Linear indexed languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797293)
