Cover Image

Separability and Non-Determinizability of WSTS

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Czerwiński, Wojciech, Keskin, Eren, Lasota, Sławomir, Meyer, Roland, Muskalla, Sebastian, Kumar, K Narayan, Saivasan, Prakash
Format:	Preprint
Published:	2023
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Separability Problem of VASS Reachability Languages
by: Keskin, Eren, et al.
Published: (2024)

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

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

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
by: Baumann, Pascal, et al.
Published: (2024)

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

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

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

One-clock synthesis problems
by: Lasota, Sławomir, et al.
Published: (2026)

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

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

PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)

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

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
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)

Solvability of orbit-finite systems of linear equations
by: Ghosh, Arka, et al.
Published: (2022)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
by: Mathew, Prince, et al.
Published: (2024)

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

History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)

Checking History-Determinism is NP-hard for Parity Automata
by: Prakash, Keya
Published: (2023)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
by: Zetzsche, Stefan, et al.
Published: (2024)

The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
by: Lehtinen, Karoliina, et al.
Published: (2025)

On Normality and Equidistribution for Separator Enumerators
by: Pulari, Subin
Published: (2026)

Exact Separation of Words via Trace Geometry
by: Chen, Zeyu, et al.
Published: (2026)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
by: Casares, Antonio, et al.
Published: (2024)

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

Iterating Non-Aggregative Structure Compositions
by: Bozga, Marius, et al.
Published: (2025)

Non-Global Parikh Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
by: Maneth, Sebastian, et al.
Published: (2025)

Attributed Tree Transducers for Partial Functions
by: Maneth, Sebastian, et al.
Published: (2024)

Non-deterministic asynchronous automata games and their undecidability
by: Adsul, Bharat, et al.
Published: (2024)

Learning EFSM Models with Registers in Guards
by: Vega, Germán, et al.
Published: (2024)

Non-interference analysis of bounded labeled Petri nets
by: Ran, Ning, et al.
Published: (2025)

Asynchronism in Cellular Automata
by: Gautam, Virendra Kumar
Published: (2025)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
by: Wehar, Michael
Published: (2025)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
by: Gallot, Paul, et al.
Published: (2023)