Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time.
Yuji Kobayashi
,
Friedrich Otto
Venue
B
MFCS
Year
1997
Proceedings
MFCS
DBLP record
conf/mfcs/KobayashiO97 ↗
Browse the full
MFCS paper archive
.