This paper considers equality hmguages and fixed-point languages of homomorphisms and deterministic gsm mappings. It provides some basic properties of these classes of languages. Vfe introduce a new subclass of dgsm mappings, the so-called symmetric dgsm mappings. We prove that (unlike for arbitrary dgsm mappings) their fixed-point languages are regular but not effectively obtainable. This resu...
