A Myhill-Nerode theorem for automata with advice
Formal Languages and Automata Theory
2012-10-10 v1 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1210.2462,
title = {A Myhill-Nerode theorem for automata with advice},
author = {Alex Kruckman and Sasha Rubin and John Sheridan and Ben Zax},
journal= {arXiv preprint arXiv:1210.2462},
year = {2012}
}
Comments
In Proceedings GandALF 2012, arXiv:1210.2028