Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
DLT
/
Paper
Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's.
Kazuo Iwama
,
Kazuya Takaki
Venue
C
DLT
Year
1997
Proceedings
Developments in Language Theory
DBLP record
conf/dlt/IwamaT97 ↗
Browse the full
DLT paper archive
.