2000 character limit reached
A Myhill-Nerode theorem for automata with advice
Published 9 Oct 2012 in cs.FL and cs.LO | (1210.2462v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.