Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
The Complexity of Finding Reset Words in Finite Automata.
Jrg Olschewski
,
Michael Ummels
Venue
B
MFCS
Year
2010
Proceedings
MFCS
DBLP record
conf/mfcs/OlschewskiU10 ↗
Browse the full
MFCS paper archive
.