Pages that link to "Item:Q5561967"
From MaRDI portal
The following pages link to Multi-tape and multi-head pushdown automata (Q5561967):
Displaying 39 items.
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Remarks on multihead pushdown automata and multihead stack automata (Q1052822) (← links)
- Alternating simple multihead finite automata (Q1058853) (← links)
- Two-dimensional automata with rotated inputs (projection-type) (Q1062451) (← links)
- A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- On 3-head versus 2-head finite automata (Q1211473) (← links)
- A note on semilinear sets and bounded-reversal multihead pushdown automata (Q1212796) (← links)
- On tape-bounded complexity classes and multihead finite automata (Q1215271) (← links)
- Two-way nested stack automata are equivalent to two-way stack automata (Q1227452) (← links)
- A useful device for showing the solvability of some decision problems (Q1230657) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- One-way simple multihead finite automata (Q1258608) (← links)
- Synchronized finite automata and 2DFA reductions (Q1261467) (← links)
- Controlled pushdown automata (Q1394126) (← links)
- Reasoning about strings in databases (Q1807679) (← links)
- On partially blind multihead finite automata. (Q2490819) (← links)
- Pushdown automata with counters (Q2554231) (← links)
- On two-way multihead automata (Q2559145) (← links)
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata (Q2666842) (← links)
- On computational power of partially blind automata (Q2867275) (← links)
- Undecidability and hierarchy results for parallel communicating finite automata (Q2909096) (← links)
- On the computational capacity of parallel communicating finite automata (Q2909225) (← links)
- Asynchronous Parallel Communicating Systems of Pushdown Automata (Q2949728) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- Three write heads are as good ask (Q3878760) (← links)
- (Q3920666) (← links)
- Relationships between pushdown automata with counters and complexity classes (Q4118823) (← links)
- (Q4146255) (← links)
- The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
- Alternation in simple devices (Q4645188) (← links)
- (Q5016364) (← links)
- New results concerning synchronized finite automata (Q5204312) (← links)
- Characterizations of transductions defined by abstract families of transducers (Q5626546) (← links)
- Using acceptors as transducers (Q5958726) (← links)
- Input-Driven Double-Head Pushdown Automata (Q6114870) (← links)
