Skip to main navigation Skip to search Skip to main content

Finite automata with advice tapes

  • Bogazici University

Research output: Chapter in Book/Report/Conference proceedingConference paperResearchpeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 17th International Conference, DLT 2013, Proceedings
Pages301-312
Number of pages12
DOIs
Publication statusPublished - 2013
Event17th International Conference on Developments in Language Theory, DLT 2013 - Marne-la-Vallee, France
Duration: 18 Jun 201321 Jun 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7907 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Conference on Developments in Language Theory, DLT 2013
Country/TerritoryFrance
CityMarne-la-Vallee
Period18/06/1321/06/13

Keywords

  • advised computation
  • finite automata
  • random advice

Cite this