The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable

MaRDI QIDQ6752895arXivFDO

Authors Dirk Nowotka, Max Wiedenhöft

Publication date 2024

Published in arXiv

Mathematics Subject Classification ID

Combinatorics on words (68R15)

arXiv classification

cs.FL

This page was built for publication: The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable

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