Pages that link to "Item:Q1148696"
From MaRDI portal
The following pages link to Multiple equality sets and Post machines (Q1148696):
Displaying 13 items.
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- On the power of several queues (Q685436) (← links)
- A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers) (Q1097706) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- On the intersection of stacks and queues (Q1123639) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- Single-tape reset machines (Q3709914) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- On some transducer equivalence problems for families of languages (Q3806848) (← links)
- Three write heads are as good ask (Q3878760) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS (Q5248992) (← links)
