Automata that take advice
From MaRDI portal
Publication:3569007
DOI10.1007/3-540-60246-1_121zbMATH Open1193.68152OpenAlexW1505876086MaRDI QIDQ3569007FDOQ3569007
Authors: Carsten Damm, Markus Holzer 
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
Recommendations
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (18)
- Determinism and Nondeterminism in Finite Automata with Advice
- Amount of Nonconstructivity in Finite Automata
- Quantum state complexity of formal languages
- Turing machines with one-sided advice and acceptance of the co-RE languages
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata
- On the amount of nonconstructivity in learning recursive functions
- One-way reversible and quantum finite automata with advice
- On the amount of nonconstructivity in learning formal languages from text
- Two-way non-uniform finite automata
- Multi-head finite automata: Data-independent versus data-dependent computations
- Two-Way Non-Uniform Finite Automata
- On the complexity of infinite advice strings
- Theory of one-tape linear-time Turing machines
- A Myhill-Nerode theorem for automata with advice
- Advice hierarchies among finite automata
- Question answering by humans and machines: a complexity-theoretic view
- Title not available (Why is that?)
- Amount of nonconstructivity in deterministic finite automata
This page was built for publication: Automata that take advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569007)
