Advice hierarchies among finite automata
From MaRDI portal
Publication:2084773
DOI10.1016/J.IC.2022.104878OpenAlexW4212975470MaRDI QIDQ2084773FDOQ2084773
Authors: Ahmet Bilal Uçan, A. C. Cem Say 
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
Recommendations
- Finite automata with advice tapes
- Finite automata with advice tapes
- Determinism and Nondeterminism in Finite Automata with Advice
- Advice Automatic Structures and Uniformly Automatic Classes
- An alternating hierarchy for finite automata
- Automata that take advice
- A Myhill-Nerode theorem for automata with advice
- THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA
- Limited two-way deterministic finite automata with advice
Cites Work
- Computational Complexity
- Turing machines that take advice
- Amount of nonconstructivity in deterministic finite automata
- Multiple usage of random bits in finite automata
- Automata that take advice
- One-way reversible and quantum finite automata with advice
- Immunity and pseudorandomness of context-free languages
- Theory of one-tape linear-time Turing machines
- Finite State Transducers with Intuition
- Title not available (Why is that?)
- FINITE AUTOMATA WITH ADVICE TAPES
- Determinism and Nondeterminism in Finite Automata with Advice
- THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Advice hierarchies among finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084773)
