Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)

11/30/2019
by   Nadia Labai, et al.
0

We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is important for reasoning about structures that use data values from infinite domains: the two-variable fragment with one total preorder and its induced successor relation, one linear order, and an arbitrary number of unary relations. We prove that the string projection of every language of data words definable in the logic is accepted by a pebble-intervals automaton A, and obtain as a corollary an automata-theoretic proof of the EXPSPACE upper bound for finite satisfiability due to Schwentick and Zeume.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2021

Register Automata with Extrema Constraints, and an Application to Two-Variable Logic

We introduce a model of register automata over infinite trees with extre...
research
07/15/2020

Descriptive Set Theory and ω-Powers of Finitary Languages

The ω-power of a finitary language L over a finite alphabet Σ is the lan...
research
02/04/2020

On Stochastic Automata over Monoids

Stochastic automata over monoids as input sets are studied. The well-def...
research
06/30/2023

The Complexity of Satisfiability Checking for Symbolic Finite Automata

We study the satisfiability problem of symbolic finite automata and deco...
research
09/10/2018

An Effective Property of ω-Rational Functions

We prove that ω-regular languages accepted by Büchi or Muller automata s...
research
03/01/2018

Sequentialization and Procedural Complexity in Automata Networks

In this article we consider finite automata networks (ANs) with two kind...
research
12/22/2021

Properties of a Class of Toeplitz Words

We study the properties of the uncountable set of Stewart words. These a...

Please sign up or login with your details

Forgot password? Click here to reset