Undecidability in Finite Transducers, Defense Systems and Finite Substitutions

11/30/2021

∙

by   Vesa Halava, et al.

∙

0

∙

share

In this manuscript we present a detailed proof for undecidability of the equivalence of finite substitutions on regular language b{0,1}^*c. The proof is based on the works of Leonid P. Lisovik.