Max Wiedenhöft

From MaRDI portal
(Redirected from Max Wiedenhöft)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The equivalence problem of E-pattern languages with regular constraints is undecidable
Theoretical Computer Science
2026-08-25Paper
The equivalence problem of E-pattern languages with length constraints is undecidable2026-07-17Paper
Tight bounds for the number of absent subsequences2026-02-26Paper
An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints
(available as arXiv preprint)
2026-01-01Paper
Word-representable graphs and locality of words2025-12-15Paper
Weighted prefix normal words
Journal of Combinatorial Theory. Series A
2025-12-11Paper
The equivalence problem of E-pattern languages with regular constraints is undecidable2025-01-20Paper
Matching patterns with variables under Simon's congruence2024-10-23Paper
Tight Bounds for the Number of Absent Scattered Factors
(available as arXiv preprint)
2024-01-01Paper
The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
(available as arXiv preprint)
2024-01-01Paper


Research outcomes over time


This page was built for person: Max Wiedenhöft