The following pages link to On pebble automata (Q1088408):
Displaying 10 items.
- A note on alternating one-pebble Turing machines with sublogarithmic space (Q844190) (← links)
- Some properties of one-pebble Turing machines with sublogarithmic space (Q2566005) (← links)
- Automata with Modulo Counters and Nondeterministic Counter Bounds (Q2914726) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- Factoring and Testing Primes in Small Space (Q3599080) (← links)
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties (Q3811712) (← links)
- The equivalence of pebbles and sensing heads for finite automata (Q5055952) (← links)
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions (Q5286060) (← links)
- (Q5416362) (← links)
