Regular Separability and Intersection Emptiness Are Independent Problems

DOI10.4230/LIPICS.FSTTCS.2019.51MaRDI QIDQ5875690zbMATH OpenOpenAlexFDO

Authors Ramanathan S. Thinniyam, Georg Zetzsche

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1908.04038

zbMATH Keywords

decidabilityintersection emptinessregular separability

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(7)

• General decidability results for asynchronous shared-memory programs: higher-order and beyond
• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
• Timed games and deterministic separability
• Separability in Büchi VASS and singly nonlinear systems of inequalities
• Regular separators for VASS coverability languages
• Separability and non-determinizability of WSTS
• The complexity of separability for semilinear sets and Parikh automata

This page was built for publication: Regular Separability and Intersection Emptiness Are Independent Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875690)