Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CPM
/
Paper
The Equivalence Problem of E-Pattern Languages with Length Constraints Is Undecidable.
Dirk Nowotka
,
Max Wiedenhft
Venue
B
CPM
Year
2025
Proceedings
CPM
DBLP record
conf/cpm/NowotkaW25 ↗
Browse the full
CPM paper archive
.