Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
Descriptional Complexity of Deterministic Regular Expressions.
Katja Losemann
,
Wim Martens
,
Matthias Niewerth
Venue
B
MFCS
Year
2012
Proceedings
MFCS
DBLP record
conf/mfcs/LosemannMN12 ↗
Browse the full
MFCS paper archive
.