Linear indexed languages
From MaRDI portal
Publication:797293
DOI10.1016/0304-3975(84)90023-9zbMATH Open0545.68067OpenAlexW2003872603MaRDI QIDQ797293FDOQ797293
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90023-9
Recommendations
homomorphic imagescontext-free langugesfull principal semi-AFLlinear indexed languagesParikh theorem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Indexed Grammars—An Extension of Context-Free Grammars
- Title not available (Why is that?)
- A geometric hierarchy of languages
- Control sets on grammars
- Title not available (Why is that?)
Cited In (26)
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
- A language hierarchy of binary relations
- Indexed counter languages
- 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 characterisation of language families in terms of inverse morphisms
- Basic tree transducers
- Storage products and linear control of derivations
- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L
- A geometric hierarchy beyond context-free languages
- Grammatical characterizations of NPDAs and VPDAs with counters
- On finite-index indexed grammars and their restrictions
- Semilinearity of Families of Languages
- Two applications of monoid actions to cross-sections
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- Title not available (Why is that?)
- Iterated linear control and iterated one-turn pushdowns
- The structure of index sets and reduced indexed grammars
- Gaining Power by Input Operations: Finite Automata and Beyond
- Title not available (Why is that?)
- 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)
