New techniques for proving the decidability of equivalence problems

Abstract

We will discuss several recently developed techniques for proving the decidability of the equivalence problem for devices defining languages and relations. Most of these techniques come from the development originated in the proof of the decidability of the DOL equivalence problem. Of particular importance is the recently shown validity of the Ehrenfeucht conjecture and its effective variations.