Pages that link to "Item:Q2805404"
From MaRDI portal
The following pages link to Limited automata and context-free languages (Q2805404):
Displaying 24 items.
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- Non-self-embedding grammars, constant-height pushdown automata, and limited automata (Q1616972) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Algebraic state space approach to model and control combined automata (Q1712571) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- Limited automata: properties, complexity and variants (Q2179326) (← links)
- Deep pushdown automata (Q2491213) (← 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)
- Reversible Limited Automata (Q2945882) (← links)
- (Q4418597) (← links)
- Strongly Limited Automata (Q4589240) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- Language acceptability of finite automata based on theory of semi‐tensor product of matrices (Q5131102) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- (Q5867525) (← links)
- Limited automata and unary languages (Q5915989) (← links)
- Linear-time limited automata (Q5919709) (← links)
- Limited automata and unary languages (Q5920129) (← links)
- Once-Marking and Always-Marking 1-Limited Automata (Q6204137) (← links)
- Performing regular operations with 1-limited automata (Q6580078) (← links)
