Automata that take advice
From MaRDI portal
Publication:3569007
DOI10.1007/3-540-60246-1_121zbMath1193.68152MaRDI 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
68Q45: Formal languages and automata
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Unnamed Item, Quantum State Complexity of Formal Languages, Determinism and Nondeterminism in Finite Automata with Advice, Two-Way Non-Uniform Finite Automata, One-way reversible and quantum finite automata with advice, Two-way non-uniform finite automata, Theory of one-tape linear-time Turing machines, Multi-head finite automata: Data-independent versus data-dependent computations, Amount of nonconstructivity in deterministic finite automata, On the amount of nonconstructivity in learning formal languages from text, Advice hierarchies among finite automata, Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata, Question answering by humans and machines: a complexity-theoretic view, On the Amount of Nonconstructivity in Learning Recursive Functions, Amount of Nonconstructivity in Finite Automata