6533b82afe1ef96bd128b657

RESEARCH PRODUCT

Finite Automata with Advice Tapes

Uğur KüçükA. C. Cem SayAbuzer Yakaryilmaz

subject

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESbusiness.product_categoryTheoretical computer scienceFinite-state machineComputer scienceTape headω-automatonDeterministic finite automatonDeterministic automatonTwo-way deterministic finite automatonNondeterministic finite automatonbusinessAdvice (complexity)Computer Science::Formal Languages and Automata Theory

description

We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, and establish the relationships between this model and the previously studied ways of providing advice to finite automata.

yearjournalcountryeditionlanguage
2013-01-01
https://doi.org/10.1007/978-3-642-38771-5_27