A Myhill-Nerode theorem for automata with advice
Alex Kruckman, Sasha Rubin, John T. Sheridan, Ben Zax · Electronic Proceedings in Theoretical Computer Science · 2012
An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice.