The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Publisher Website
Google Scholar
Abstract
It is shown that the equivalence problem for A-free nondeterministic generalized machines is unsolvable, and it is observed that this result implies the unsolvability of the equality problem for c -finite languages.