Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
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
Matthew A Grayson
Journal of Complexity
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
George Markowsky
J. Math. Anal. Appl.