A generalization of context-free determinism
From MaRDI portal
Cited in
(28)- The halting problem for linear Turing assemblers
- A relation between space, return and dual return complexities
- Descriptional complexity of limited automata
- Theory of formal grammars
- Descriptional complexity of regular languages
- Performing regular operations with 1-limited automata
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-k storage automata
- Deterministic stack transducers
- scientific article; zbMATH DE number 3868645 (Why is no real title available?)
- Deterministic realization of nondeterministic computations with a low measure of nondeterminism
- Deterministic stack transducers
- Characterization of context-free languages by erasing automata
- Limited automata and regular languages
- On simulation cost of unary limited automata
- Non-self-embedding grammars, constant-height pushdown automata, and limited automata
- 1-limited automata: witness languages and techniques
- Limited automata and unary languages
- Linear-time limited automata
- Nondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract)
- Two-way machines and de Bruijn words
- Once-Marking and Always-Marking 1-Limited Automata
- Performing regular operations with 1-limited automata
- Deterministic tree-walking-storage automata
- Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
- What is the most natural generalized pumping lemma beyond regular and context-free languages?
- Forgetting 1-limited automata
- Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm
- A linear-time simulation of deterministic \(d\)-limited automata
This page was built for publication: A generalization of context-free determinism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5554975)
