H.O. Posten
Technometrics
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
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
G. Pawlowski, T.P. Sauer, et al.
Microlithography 1990