Pages that link to "Item:Q5585423"
From MaRDI portal
The following pages link to Sets accepted by one-way stack automata are context sensitive (Q5585423):
Displaying 13 items.
- Stack languages and log n space (Q1250712) (← links)
- A note on self-modifying finite automata (Q1583051) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Closures which preserve finiteness in families of languages (Q2527944) (← links)
- Unilateral context sensitive grammars and left-to-right parsing (Q2551320) (← links)
- Deterministic Stack Transducers (Q2830204) (← links)
- Rudimentary relations and stack languages (Q4147594) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- Space Complexity of Stack Automata Models (Q5041255) (← links)
- The theory of languages (Q5551468) (← links)
- The theory of languages (Q5592247) (← links)
- Reachability Analysis of Pushdown Systems with an Upper Stack (Q5739017) (← links)
- Space Complexity of Stack Automata Models (Q6169902) (← links)