Advice hierarchies among finite automata

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

zbMATH Keywords

automata theoryformal languagesadvised computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Special issue: Selected papers of the 14th international conference on language and automata theory and applications, LATA 2020

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