Pages that link to "Item:Q1109567"

The following pages link to Tape versus queue and stacks: The lower bounds (Q1109567):

Displaying 9 items.

• Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
• On the power of several queues (Q685436) (← links)
• k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
• Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
• \(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs (Q1201728) (← links)
• The complexity of matrix transposition on one-tape off-line Turing machines with output tape (Q1208717) (← links)
• Three one-way heads cannot do string matching (Q1318467) (← links)
• Two tapes versus one for off-line Turing machines (Q1321033) (← links)
• The speed of copying on one-tape off-line turing machines (Q1824387) (← links)