Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
DLT
/
Paper
Minimizing Finite Automata Is Computationally Hard.
Andreas Malcher
Venue
C
DLT
Year
2003
Proceedings
Developments in Language Theory
DBLP record
conf/dlt/Malcher03 ↗
Browse the full
DLT paper archive
.