Decidability of second-order theories and automata on infinite trees

DOI10.1090/S0002-9904-1968-12122-6zbMath0313.02029MaRDI QIDQ4071739

Michael O. Rabin

Publication date: 1968

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (8)

Rewriting Higher-Order Stack Trees ⋮ Weighted Automata on Infinite Words in the Context of Attacker-Defender Games ⋮ Rewriting higher-order stack trees ⋮ Compositional synthesis of control barrier certificates for networks of stochastic systems against \(\omega\)-regular specifications ⋮ Tree languages and branched groups ⋮ Weighted automata on infinite words in the context of attacker-defender games ⋮ On Robot Games of Degree Two ⋮ Existential second-order logic and modal logic with quantified accessibility relations

Cites Work

• Decision methods in the theory of ordinals
• Undecidability of Some Topological Theories
• Unnamed Item

This page was built for publication: Decidability of second-order theories and automata on infinite trees