Deciding emptiness for constraint automata on strings with the prefix and suffix order

DOI10.4230/LIPICS.MFCS.2022.76MaRDI QIDQ6584082zbMATH OpenFDO

Authors Dominik Peteler, Karin Quaas

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.76

zbMATH Keywords

automataconstraintsdata languageslinear temporal logicprefixstringssuffix

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(4)

• First steps towards taming description logics with strings
• Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
• Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
• Reachability and bounded emptiness problems of constraint automata with prefix, suffix and infix

This page was built for publication: Deciding emptiness for constraint automata on strings with the prefix and suffix order

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