Cover Image

Existential Definability over the Subword Ordering

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Baumann, Pascal, Ganardi, Moses, Thinniyam, Ramanathan S., Zetzsche, Georg
Format:	Preprint
Published:	2022
Subjects:	Logic in Computer Science Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
by: Lichtner, Kilian, et al.
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

Directed Regular and Context-Free Languages
by: Ganardi, Moses, et al.
Published: (2024)

Slice closures of indexed languages and word equations with counting constraints
by: Ciobanu, Laura, et al.
Published: (2024)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
by: Shakiba, Yousef, et al.
Published: (2025)

Length Generalization Bounds for Transformers
by: Yang, Andy, et al.
Published: (2026)

Softmax Transformers are Turing-Complete
by: Jiang, Hongjian, et al.
Published: (2025)

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

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

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

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

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
by: Bueri, Lucas, et al.
Published: (2024)

On the Impact of the Communication Model on Realisability
by: Di Giusto, Cinzia, et al.
Published: (2025)

Synthesizing Computable Functions from Rational Specifications over Infinite Words
by: Filiot, Emmanuel, et al.
Published: (2021)

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)

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

Bounded treewidth, multiple context-free grammars, and downward closures
by: Aiswarya, C., et al.
Published: (2025)

On the complexity of computing Strahler numbers
by: Ganardi, Moses, et al.
Published: (2025)

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

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

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

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Positive Hennessy-Milner Logic for Branching Bisimulation
by: Geuvers, Herman, et al.
Published: (2022)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2022)

Separators in Continuous Petri Nets
by: Blondin, Michael, et al.
Published: (2022)

A Hierarchy of Nondeterminism
by: Radi, Bader Abu, et al.
Published: (2022)

An Elementary Proof of the FMP for Kleene Algebra
by: Kappé, Tobias
Published: (2022)

On Good-for-MDPs Automata
by: Schewe, Sven, et al.
Published: (2022)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
by: Czerwiński, Wojciech, et al.
Published: (2022)

Characterising memory in infinite games
by: Casares, Antonio, et al.
Published: (2022)

Monitoring Timed Properties (Revisited)
by: Grosen, Thomas Møller, et al.
Published: (2022)

A Dichotomy Theorem for Automatic Structures
by: Cuvelier, Antoine, et al.
Published: (2026)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)