The following pages link to Reset machines (Q1136756):
Displayed 19 items.
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- Partial commutations and faithful rational transductions (Q799383) (← links)
- On the intersection of the class of linear context-free languages and the class of single-reset languages (Q1094883) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- On the intersection of stacks and queues (Q1123639) (← links)
- Multiple equality sets and Post machines (Q1148696) (← links)
- The inclusion of D0L in multi-reset (Q1162162) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- On some bounded semiAFLs and AFLs (Q1837538) (← links)
- Langages à un compteur (Q1838045) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- On characterisation of language families in terms of inverse morphisms (Q3343457) (← links)
- Single-tape reset machines (Q3709914) (← links)
- Characterizations of reduction classes modulo oracle conditions (Q3763590) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- The equivalence of deterministic gsm replications onQ-rational languages is decidable (Q3779775) (← links)
- Three write heads are as good ask (Q3878760) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)