Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
arXiv:2111.15420
Abstract
In this manuscript we present a detailed proof for undecidability of the equivalence of finite substitutions on regular language . The proof is based on the works of Leonid P. Lisovik.