Pages that link to "Item:Q1041220"

The following pages link to Theory of one-tape linear-time Turing machines (Q1041220):

Displaying 24 items.

• Verifying time complexity of Turing machines (Q496007) (← links)
• Immunity and pseudorandomness of context-free languages (Q653340) (← links)
• Two-way non-uniform finite automata (Q832933) (← links)
• A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
• Element distinctness on one-tape Turing machines: a complete solution (Q1889761) (← links)
• Verifying whether one-tape Turing machines run in linear time (Q2009635) (← links)
• Advice hierarchies among finite automata (Q2084773) (← links)
• Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
• Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata (Q2164011) (← links)
• Computational power of one-way Turing machines with sublogarithmic memory restrictions (Q2262923) (← links)
• Multiple Usage of Random Bits in Finite Automata (Q2898066) (← links)
• (Q3751009) (← links)
• (Q5089196) (← links)
• (Q5192993) (← links)
• FINITE AUTOMATA WITH ADVICE TAPES (Q5247170) (← links)
• SOFSEM 2004: Theory and Practice of Computer Science (Q5902006) (← links)
• How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
• Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
• Linear-time limited automata (Q5919709) (← links)
• Weight-reducing Turing machines (Q6040666) (← links)
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability (Q6102995) (← links)
• Determinism and Nondeterminism in Finite Automata with Advice (Q6163614) (← links)
• Two-Way Non-Uniform Finite Automata (Q6169962) (← links)
• Power of counting by nonuniform families of polynomial-size finite automata (Q6546609) (← links)