Beiträge in Tagungsbänden:
A. Kruckman, S. Rubin, J. Sheridan, B. Zax:
"A Myhill-Nerode theorem for automata with advice";
in: "Symposium on Games, Automata, Logics and Formal Verification",
M. Faella, A. Murano (Hrg.);
Electronic Proceedings in Theoretical Computer Science,
2012,
S. 238
- 246.
Kurzfassung englisch:
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.
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.4204/EPTCS.96.18
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.