Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
Halava Vesa
Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
Halava Vesa
arXiv.org
Julkaisun pysyvä osoite on:
https://urn.fi/URN:NBN:fi-fe2022020818027
https://urn.fi/URN:NBN:fi-fe2022020818027
Tiivistelmä
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.
Kokoelmat
- Rinnakkaistallenteet [19207]