Pages that link to "Item:Q5554975"
From MaRDI portal
The following pages link to A generalization of context-free determinism (Q5554975):
Displaying 22 items.
- Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm (Q757074) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- The halting problem for linear Turing assemblers (Q1231906) (← links)
- A relation between space, return and dual return complexities (Q1259165) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata (Q2695283) (← links)
- Deterministic Stack Transducers (Q2830204) (← links)
- (Q3335012) (← links)
- Deterministic realization of nondeterministic computations with a low measure of nondeterminism (Q4007372) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- Characterization of context-pree languages by erasing automata (Q5096842) (← links)
- LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- (Q5867525) (← links)
- Limited automata and unary languages (Q5915989) (← links)
- Linear-time limited automata (Q5919709) (← links)
- Once-Marking and Always-Marking 1-Limited Automata (Q6204137) (← links)
- Performing regular operations with 1-limited automata (Q6580078) (← links)
