47 citations · 159 across the 27 of their papers we have counts for
Showing 2014 · cs.LOShow all
2 papers · 2 filters
cs.LO2014
Weak MSO+U with Path Quantifiers over Infinite Trees
Mikołaj Bojańczyk
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite…
cs.LO2014★ 47 cited
Automata theory in nominal sets
Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensui…