Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ITW
/
Paper
Computing the Levenshtein distance of a regular language.
Stavros Konstantinidis
Venue
B
ITW
Year
2005
Proceedings
ITW
DBLP record
conf/itw/Konstantinidis05 ↗
Browse the full
ITW paper archive
.