16 citations · 19 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.FL2021
Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
Vesa Halava
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 L…
cs.DM2021
On Bi-infinite and Conjugate Post Correspondence Problems
Olivier Finkel, Vesa Halava, Tero Harju +1
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two give…