1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.FL2021
Conelikes and Ranker Comparisons
Viktor Henriksson, Manfred Kufleitner
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belong…
cs.FL2021
Deciding FO2 Alternation for Automata over Finite and Infinite Words
Viktor Henriksson, Manfred Kufleitner
We consider two-variable first-order logic and its quantifier alternation hierarchies over both finite and infinite words. Our main results are forbidden patterns for…
cs.FL2020★ 1 cited
Nesting negations in FO2 over infinite words
Viktor Henriksson, Manfred Kufleitner
We consider two-variable first-order logic FO2 over infinite words. Restricting the number of nested negations defines an infinite hierarchy; its levels are often called the half-l…