Open Access · CC BY 4.0
The equivalence problem of E-pattern languages with regular constraints is undecidable
Theoretical Computer Science · 2026-09 · 1083 · 116126
DOI: 10.1016/j.tcs.2026.116126 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-09. Verfasst von Dirk Nowotka und 1 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: German Research Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- German Research Foundation
Zitieren
APA
Nowotka, D., & Wiedenhöft, M. (2026). The equivalence problem of E-pattern languages with regular constraints is undecidable. Theoretical Computer Science, 1083, 116126. https://doi.org/10.1016/j.tcs.2026.116126
Vancouver
Nowotka D, Wiedenhöft M. The equivalence problem of E-pattern languages with regular constraints is undecidable. Theoretical Computer Science. 2026;1083:116126. doi:10.1016/j.tcs.2026.116126
BibTeX
@article{Nowotka2026,
author = {Nowotka, Dirk and Wiedenhöft, Max},
title = {The equivalence problem of E-pattern languages with regular constraints is undecidable},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1083},
pages = {116126},
doi = {10.1016/j.tcs.2026.116126}
}
EUVIMED