Automata that take advice
From MaRDI portal
Publication:3569007
DOI10.1007/3-540-60246-1_121zbMath1193.68152OpenAlexW1505876086MaRDI QIDQ3569007
Publication date: 17 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60246-1_121
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Two-way non-uniform finite automata, Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata, Question answering by humans and machines: a complexity-theoretic view, Determinism and Nondeterminism in Finite Automata with Advice, Two-Way Non-Uniform Finite Automata, Amount of nonconstructivity in deterministic finite automata, One-way reversible and quantum finite automata with advice, On the Amount of Nonconstructivity in Learning Recursive Functions, Unnamed Item, On the amount of nonconstructivity in learning formal languages from text, Amount of Nonconstructivity in Finite Automata, Theory of one-tape linear-time Turing machines, Quantum State Complexity of Formal Languages, Advice hierarchies among finite automata, Multi-head finite automata: Data-independent versus data-dependent computations