Sankar Basu
Journal of the Franklin Institute
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
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Chai Wah Wu
Linear Algebra and Its Applications
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences