Cover Image

The Decision Problem for Regular First-Order Theories

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mathur, Umang, Mestel, David, Viswanathan, Mahesh
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science Formal Languages and Automata Theory Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parametrizing Reads-From Equivalence for Predictive Monitoring
by: Farzan, Azadeh, et al.
Published: (2026)

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

Enhanced Data Race Prediction Through Modular Reasoning
by: Ang, Zhendong, et al.
Published: (2025)

Finding Regular Herbrand Models for CHCs using Answer Set Programming
by: Maire, Gregoire, et al.
Published: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

Fractals from Regular Behaviours
by: Schmid, Todd, et al.
Published: (2023)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes
by: Różowski, Wojciech, et al.
Published: (2026)

Weighted GKAT: Completeness and Complexity
by: Van Koevering, Spencer, et al.
Published: (2025)

Verifying Asynchronous Hyperproperties in Reactive Systems
by: Beutner, Raven, et al.
Published: (2025)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
by: Moreau, Vincent, et al.
Published: (2023)

SuperDP: Differential Privacy Refutation via Supermartingales
by: Chatterjee, Krishnendu, et al.
Published: (2026)

Towards a Coq-verified Chain of Esterel Semantics
by: Berry, Gérard, et al.
Published: (2019)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

Characterization and Decidability of FC-Definable Regular Languages
by: Thompson, Sam M., et al.
Published: (2025)

Synthesis of Computable Regular Functions of Infinite Words
by: Dave, V., et al.
Published: (2019)

Algebraic Characterizations of Classes of Regular Languages in DynFO
by: Barloy, Corentin, et al.
Published: (2026)

On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
by: Ancona, Davide, et al.
Published: (2025)

Beyond Decisiveness of Infinite Markov Chains
by: Barbot, Benoît, et al.
Published: (2024)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)

Decision Questions for Probabilistic Automata on Small Alphabets
by: Bell, Paul C., et al.
Published: (2021)

First-Order Intuitionistic Linear Logic and Hypergraph Languages
by: Pshenitsyn, Tikhon
Published: (2025)

Slightly Non-Linear Higher-Order Tree Transducers
by: Nguyên, Lê Thành Dũng, et al.
Published: (2024)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
by: Finkbeiner, Bernd, et al.
Published: (2026)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report)
by: Jiang, Hongjian, et al.
Published: (2025)

A Uniform Framework for Language Inclusion Problems
by: Doveri, Kyveli, et al.
Published: (2024)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
by: Alexaj, Ondrej, et al.
Published: (2026)

On the Reachability Problem for Two-Dimensional Branching VASS
by: Bizière, Clotilde, et al.
Published: (2025)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
by: Zhang, Yuanrui, et al.
Published: (2023)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
by: Mandrioli, Dino, et al.
Published: (2020)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)

A Direct Translation from LTL with Past to Deterministic Rabin Automata
by: Azzopardi, Shaun, et al.
Published: (2024)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
by: Jecker, Ismaël, et al.
Published: (2023)