Pages that link to "Item:Q2537131"
From MaRDI portal
The following pages link to Über einen Automaten mit Pufferspeicherung (Q2537131):
Displayed 13 items.
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- On the power of several queues (Q685436) (← links)
- Multiple equality sets and Post machines (Q1148696) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- Deque automata, languages, and planar graph representations (Q2192371) (← links)
- Two collapsing hierarchies of subregularly tree controlled languages (Q2271461) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- PROGRAMMED GRAMMARS WITH RULE QUEUES (Q3401467) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Diving into the queue (Q5223609) (← links)
- Boosting Reversible Pushdown and Queue Machines by Preprocessing (Q5859661) (← links)