New techniques for proving the decidability of equivalence problems,☆☆

https://doi.org/10.1016/0304-3975(90)90189-OGet rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

Reported research was supported by the National Sciences Foundation under Grant No. CCR-8702752 and by the Natural Sciences and Engineering Research Council of Canada under Grant No. A-7403.

☆☆

The preliminary version of this paper was presented at the 15th ICALP in Tampere, Finland, July 1988.