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.
No takes yet. Share an insight, caveat, or question.
T. V. Griffiths (1968) studied this question.