notesum.ai

Published at November 11

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

cs.FL
cs.CC
math.CO
68R15
F.4.3

Released Date: November 11, 2024

Authors: Dirk Nowotka1, Max Wiedenhöft1

Aff.: 1Department of Computer Science, Kiel University, Germany

Arxiv: http://arxiv.org/abs/2411.07275v1