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

DOI10.4230/LIPICS.MFCS.2022.76MaRDI QIDQ6584082

Dominik Peteler, Karin Quaas

Publication date: 6 August 2024

zbMATH Keywords

automatastringsconstraintsprefixlinear temporal logicdata languagessuffix

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

First steps towards taming description logics with strings

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)