The following pages link to Automata that take advice (Q3569007):
Displaying 15 items.
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Two-way non-uniform finite automata (Q832933) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- Amount of nonconstructivity in deterministic finite automata (Q1959651) (← links)
- On the amount of nonconstructivity in learning formal languages from text (Q2051759) (← links)
- Advice hierarchies among finite automata (Q2084773) (← links)
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata (Q2164011) (← links)
- Question answering by humans and machines: a complexity-theoretic view (Q2422044) (← links)
- On the Amount of Nonconstructivity in Learning Recursive Functions (Q3010414) (← links)
- Amount of Nonconstructivity in Finite Automata (Q3637360) (← links)
- (Q5089196) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Determinism and Nondeterminism in Finite Automata with Advice (Q6163614) (← links)
- Two-Way Non-Uniform Finite Automata (Q6169962) (← links)