Other publication

Undecidability in Finite Transducers, Defense Systems and Finite Substitutions



Authors: Halava Vesa

Publisher: arXiv.org

Publication year: 2021

Journal: arXiv.org

Web address : https://arxiv.org/abs/2111.15420

Self-archived copy’s web address: https://arxiv.org/abs/2111.15420


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.


Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.


Last updated on 2024-26-11 at 20:07