Pages that link to "Item:Q1230657"
From MaRDI portal
The following pages link to A useful device for showing the solvability of some decision problems (Q1230657):
Displaying 10 items.
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- More decidable instances of Post's correspondence problem: beyond counting (Q963345) (← links)
- One-way simple multihead finite automata are not closed under concatenation (Q1056554) (← links)
- Alternating simple multihead finite automata (Q1058853) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- One-way simple multihead finite automata (Q1258608) (← links)
- On the Density of Context-Free and Counter Languages (Q4640039) (← links)
- A NOTE ON REBOUND TURING MACHINES (Q4667926) (← links)
