Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
: Halava Vesa
Publisher: arXiv.org
: 2021
arXiv.org
: https://arxiv.org/abs/2111.15420
: https://arxiv.org/abs/2111.15420
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.
UTU Research Portal