Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Paper
Decidability of second-order theories and automata on infinite trees
Abstract
In this note we announce the solvability of the decision problem of the (monadic) second-order theory of two suc- cessor functions (S2S). This answers a question raised by Büchi.
Related
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence