Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FCT
/
Paper
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.
Friedrich Otto
,
Andrea Sattler-Klein
Venue
B
FCT
Year
1997
Proceedings
FCT
DBLP record
conf/fct/OttoS97 ↗
Browse the full
FCT paper archive
.