Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
arXiv:2111.15420v1
Originality Synthesis-oriented
AI Analysis
This addresses a theoretical problem in formal language theory, but it appears incremental as it builds directly on existing proofs.
The paper tackles the problem of proving the undecidability of equivalence for finite substitutions on a specific regular language, and it presents a detailed proof based on prior work by Leonid P. Lisovik.
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.