论文信息 - A Myhill-Nerode theorem for automata with advice

A Myhill-Nerode theorem for automata with advice

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.

John Sheridan | Sasha Rubin | Alex Kruckman | Ben Zax

[1] Calvin C. Elgot,et al. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor , 1966, Journal of Symbolic Logic.

[2] Christof Löding,et al. Transforming structures by set interpretations , 2007, Log. Methods Comput. Sci..

[3] André Nies,et al. Describing Groups , 2007, Bulletin of Symbolic Logic.

[4] Séverine Fratani,et al. Regular sets over extended tree structures , 2012, Theor. Comput. Sci..

[5] Vince Bárány. A Hierarchy of Automatic Words having a Decidable MSO Theory , 2006 .

[6] Alexander Moshe Rabinovich,et al. Decidable Theories of the Ordering of Natural Numbers with Unary Predicates , 2006, CSL.

[7] Sasha Rubin,et al. Automata Presenting Structures: A Survey of the Finite String Case , 2008, Bulletin of Symbolic Logic.

[8] Olivier Carton,et al. The Monadic Theory of Morphic Infinite Words and Generalizations , 2000, Inf. Comput..

[9] Vince Bárány,et al. A Hierarchy of Automatic $\omega$-Words having a Decidable MSO Theory , 2008, RAIRO Theor. Informatics Appl..

[10] Todor Tsankov,et al. The additive group of the rationals does not have an automatic presentation , 2009, The Journal of Symbolic Logic.

[11] Dexter Kozen. On the Myhill-Nerode Theorem for Trees , 1992 .