Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FCT
/
Paper
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable.
Michal Kunc
Venue
B
FCT
Year
2007
Proceedings
FCT
DBLP record
conf/fct/Kunc07 ↗
Browse the full
FCT paper archive
.