Finite Substitutions and Integer Weighted Finite Automata


In this work we present a new chain of undecidability reductions, which begins from the classical halting problem of Turing machines and ends to the undecidability proof of the equivalence problem for nite substitutions on regular languages in Chapter 4. This undecidability result was originally proved by L. Lisovik in 1997. We present a new proof, which is… (More)


2 Figures and Tables

Slides referencing similar topics