Decidability of second-order theories and automata on infinite trees

Michael O. Rabin

doi:10.1090/S0002-9904-1968-12122-6

Bulletin of the American Mathematical Society

Paper

01 Jan 1968

Decidability of second-order theories and automata on infinite trees

Download paper

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.

Paper

Interactive scheduling as a constraint satisfiability problem

Ronen Feldman, Martin Charles Golumbic

Ann. Math. Artif. Intell.

Workshop paper

SPRIG: Stackelberg Perception-Reinforcement Learning with Internal Game Dynamics

Fernando Martinez, Juntao Chen, et al.

AAAI 2025

Paper

Dynamically Meaningful Latent Representations of Dynamical Systems

Imran Nasim, Michael E. Henderson

Mathematics

Paper

Joint spectral radius and path-complete graph Lyapunov functions

Amir Ali Ahmadi, Raphaël M. Jungers, et al.

SICON

View all publications

Abstract

Related

Interactive scheduling as a constraint satisfiability problem

SPRIG: Stackelberg Perception-Reinforcement Learning with Internal Game Dynamics

Dynamically Meaningful Latent Representations of Dynamical Systems

Joint spectral radius and path-complete graph Lyapunov functions