Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
Formal Languages and Automata Theory
2021-12-01 v1 Computation and Language
Discrete Mathematics
Abstract
In this manuscript we present a detailed proof for undecidability of the equivalence of finite substitutions on regular language . The proof is based on the works of Leonid P. Lisovik.
Cite
@article{arxiv.2111.15420,
title = {Undecidability in Finite Transducers, Defense Systems and Finite Substitutions},
author = {Vesa Halava},
journal= {arXiv preprint arXiv:2111.15420},
year = {2021}
}