Rabin introduced infinite-tree automata and proved that the monadic second-order theory of n successors (S2S when n = 2) is decidable
Text from Wikipedia, available under CC BY-SA 4.0.
- #wikipedia
- #event
Rabin introduced infinite-tree automata and proved that the monadic second-order theory of n successors (S2S when n = 2) is decidable
Text from Wikipedia, available under CC BY-SA 4.0.
Captured 2026-08-19 from Wikipedia. The archived copy is preserved so this citation survives link rot.