Recommendations
Cites work
- Amount of nonconstructivity in deterministic finite automata
- Finite state verifiers I
- Immunity and pseudorandomness of context-free languages
- THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA
- Theory of one-tape linear-time Turing machines
- Unbounded-error quantum computation with small space bounds
Cited in
(16)- Advice hierarchies among finite automata
- Two-way and one-way quantum and classical automata with advice for online minimization problems
- Advice coins for classical and quantum computation
- Automata that take advice
- The roles of advice to one-tape linear-time Turing machines and finite automata (extended abstract)
- scientific article; zbMATH DE number 1222567 (Why is no real title available?)
- scientific article; zbMATH DE number 6991602 (Why is no real title available?)
- A Myhill-Nerode theorem for automata with advice
- On the complexity of infinite advice strings
- scientific article; zbMATH DE number 7559401 (Why is no real title available?)
- Finite automata with advice tapes
- Determinism and Nondeterminism in Finite Automata with Advice
- Two-Way Non-Uniform Finite Automata
- Multi-head two-way finite automata with advice
- Limited two-way deterministic finite automata with advice
- Two-way non-uniform finite automata
This page was built for publication: Finite automata with advice tapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5247170)
