Cover Image

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Czerwiński, Wojciech, Orlikowski, Łukasz
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reachability in 3-VASS is Elementary
by: Czerwiński, Wojciech, et al.
Published: (2025)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
by: Chistikov, Dmitry, et al.
Published: (2024)

Languages of Boundedly-Ambiguous Vector Addition Systems with States
by: Czerwiński, Wojciech, et al.
Published: (2025)

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

Reachability in VASS Extended with Integer Counters
by: Bizière, Clotilde, et al.
Published: (2026)

Exploring VASS Parameterised by Geometric Dimension
by: Czerwiński, Wojciech, et al.
Published: (2026)

Resolving Nondeterminism with Randomness
by: Henzinger, Thomas A., et al.
Published: (2025)

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

Improved Algorithm for Reachability in $d$-VASS
by: Fu, Yuxi, et al.
Published: (2024)

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

Continuous Pushdown VASS in One Dimension are Easy
by: Perez, Guillermo A., et al.
Published: (2024)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Guha, Shibashis, et al.
Published: (2021)

Reachability in Geometrically $d$-Dimensional VASS
by: Fu, Yuxi, et al.
Published: (2025)

Systemic Constraints of Undecidability
by: Bulin, Seth
Published: (2025)

Algebraic Closure of Matrix Sets Recognized by 1-VASS
by: Manssour, Rida Ait El, et al.
Published: (2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)

Reachability in symmetric VASS
by: Kamiński, Łukasz, et al.
Published: (2025)

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

A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
by: Takata, Yoshiaki, et al.
Published: (2024)

Bi-reachability in Petri nets with data
by: Kamiński, Łukasz, et al.
Published: (2024)

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

Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)

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

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

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

Random Graph Generation in Context-Free Graph Languages
by: Vastarini, Federico, et al.
Published: (2024)

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

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
by: Tsai, Wei-Lun, et al.
Published: (2026)

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

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)

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

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)

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

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)

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

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

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

NILE: Formalizing Natural-Language Descriptions of Formal Languages
by: Kneisel, Tristan, et al.
Published: (2026)