default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax Wiedenhöft
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j1]Da-Jung Cho, Szilárd Zsolt Fazekas, Shinnosuke Seki, Max Wiedenhöft:
A formalization of co-transcriptional splicing as an operation on formal languages. Nat. Comput. 24(4): 991-1009 (2025)- [c6]Dirk Nowotka, Max Wiedenhöft
:
The Equivalence Problem of E-Pattern Languages with Length Constraints Is Undecidable. CPM 2025: 4:1-4:23 - [c5]Philipp Böll, Pamela Fleischmann, Annika Huch, Jana Kreiß, Tim Löck, Kajus Park, Max Wiedenhöft:
Word-Representable Graphs and Locality of Words. DCFS 2025: 50-63 - [c4]Da-Jung Cho, Szilárd Zsolt Fazekas, Shinnosuke Seki, Max Wiedenhöft:
Programmable Co‑Transcriptional Splicing: Realizing Regular Languages via Hairpin Deletion. DNA 2025: 5:1-5:22 - [c3]Duncan Adamson, Pamela Fleischmann, Annika Huch, Florin Manea, Paul Sarnighausen-Cahn, Max Wiedenhöft:
Tight Bounds for the Number of Absent Subsequences. FCT 2025: 15-29 - [i8]Da-Jung Cho, Szilárd Zsolt Fazekas, Shinnosuke Seki, Max Wiedenhöft:
A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages. CoRR abs/2504.13354 (2025) - [i7]Philipp Böll, Pamela Fleischmann, Annika Huch, Jana Kreiß, Tim Löck, Kajus Park, Max Wiedenhöft:
Word-Representable Graphs and Locality of Words. CoRR abs/2506.19493 (2025) - [i6]Da-Jung Cho, Szilárd Zsolt Fazekas, Shinnosuke Seki, Max Wiedenhöft:
Programmable Co-Transcriptional Splicing: Realizing Regular Languages via Hairpin Deletion. CoRR abs/2506.23384 (2025) - [i5]Klaus Jansen, Dirk Nowotka, Lis Pirotton, Corinna Wambsganz, Max Wiedenhöft:
An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints. CoRR abs/2512.07476 (2025) - 2024
- [c2]Dirk Nowotka, Max Wiedenhöft:
The Equivalence Problem of E-Pattern Languages with Regular Constraints Is Undecidable. CIAA 2024: 276-288 - [i4]Duncan Adamson, Pamela Fleischmann, Annika Huch, Max Wiedenhöft:
Tight Bounds for the Number of Absent Scattered Factors. CoRR abs/2407.18599 (2024) - [i3]Dirk Nowotka, Max Wiedenhöft:
The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable. CoRR abs/2411.06904 (2024) - [i2]Dirk Nowotka, Max Wiedenhöft:
The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable. CoRR abs/2411.07275 (2024) - 2023
- [c1]Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft:
Matching Patterns with Variables Under Simon's Congruence. RP 2023: 155-170 - [i1]Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft:
Matching Patterns with Variables Under Simon's Congruence. CoRR abs/2308.08374 (2023)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-01-25 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
