Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
Not on the map. Why?
Abstract (arXiv)
In this manuscript we present a detailed proof for undecidability of the equivalence of finite substitutions on regular language b0,1^*c. The proof is based on the works of Leonid P. Lisovik.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 13 references that are in the map. First posted on arXiv 30 Nov 2021.
Builds on
0 of 13 references.
No references here yet.
Built on by
Not cited yet.