Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
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
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
Conference paper
Compression scheme for digital cinema application
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002