MSO on the Infinite Binary Tree: Choice and Order
From MaRDI portal
Publication:3608411
DOI10.1007/978-3-540-74915-8_15zbMath1179.03016OpenAlexW1556439147MaRDI QIDQ3608411
Arnaud Carayol, Christof Löding
Publication date: 5 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00620169/file/csl07.pdf
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
Tree-automatic scattered linear orders ⋮ Second-order finite automata: expressive power and simple proofs using automatic structures ⋮ Delay Games with WMSO$$+$$U Winning Conditions ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Unnamed Item ⋮ The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata ⋮ On Monadic Theories of Monadic Predicates ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ Monoidal-closed categories of tree automata ⋮ Unnamed Item ⋮ Unambiguity in Automata Theory ⋮ Unnamed Item
This page was built for publication: MSO on the Infinite Binary Tree: Choice and Order
