Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.