Advice hierarchies among finite automata
From MaRDI portal
Publication:2084773
DOI10.1016/j.ic.2022.104878OpenAlexW4212975470MaRDI QIDQ2084773
A. C. Cem Say, Ahmet Bilal Uçan
Publication date: 13 October 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104878
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- One-way reversible and quantum finite automata with advice
- Immunity and pseudorandomness of context-free languages
- Turing machines that take advice
- Theory of one-tape linear-time Turing machines
- Amount of nonconstructivity in deterministic finite automata
- Multiple Usage of Random Bits in Finite Automata
- THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA
- Automata that take advice
- Finite State Transducers with Intuition
- FINITE AUTOMATA WITH ADVICE TAPES
- Computational Complexity
- Determinism and Nondeterminism in Finite Automata with Advice
This page was built for publication: Advice hierarchies among finite automata