Pages that link to "Item:Q476173"

The following pages link to One-way reversible and quantum finite automata with advice (Q476173):

Displaying 10 items.

• Pseudorandom generators against advised context-free languages (Q899305) (← links)
• Reversible computation in term rewriting (Q1683707) (← links)
• Advice hierarchies among finite automata (Q2084773) (← links)
• Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
• (Q2890225) (redirect page) (← links)
• Quantum Pushdown Automata with Garbage Tape (Q4640342) (← links)
• Quantum State Complexity of Formal Languages (Q5500700) (← 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)
• Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)