Weak MSO+U with Path Quantifiers over Infinite Trees

DOI10.1007/978-3-662-43951-7_4zbMath1407.03006arXiv1404.7278OpenAlexW10842229MaRDI QIDQ5167825

Mikołaj Bojańczyk

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.7278

Mathematics Subject Classification ID

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

Related Items (6)

Delay Games with WMSO$$+$$U Winning Conditions ⋮ Recursion Schemes and the WMSO+U Logic ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Church synthesis on register automata over linearly ordered data domains ⋮ Unnamed Item

This page was built for publication: Weak MSO+U with Path Quantifiers over Infinite Trees