Rankers over infinite words

Authors:
Luc Dartois;Manfred Kufleitner;Alexander Lauser
Affiliations:
ENS Cachan, France;FMI, Universität Stuttgart, Germany;FMI, Universität Stuttgart, Germany
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 3
Cited 2

Over words, two variables are as powerful as one quantifier alternation

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Partially-Ordered Two-Way Automata: A New Characterization of DA

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Polynomials, fragments of temporal logic and the variety DA over traces

Theoretical Computer Science

On expressive powers of timed logics: comparing boundedness, non-punctuality, and deterministic freezing

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Regular ideal languages and their boolean combinations

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the fragments FO2, Σ2 ∩FO2, Π2 ∩FO2, and Δ2 of first-order logic FO[2. Moreover, the first extension of rankers admits a characterization of Σ2 ∩ FO2 while the other leads to a characterization of Π2 ∩ FO2. Both versions of rankers yield characterizations of the fragment Δ2 = Σ2∩Π2. As a byproduct, we also obtain characterizations based on unambiguous temporal logic and unambiguous interval temporal logic.