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

1 July 1968

journal article
Published by Association for Computing Machinery (ACM) in Journal of the ACM

Vol. 15 (3) , 409-413
https://doi.org/10.1145/321466.321473

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.

Keywords

A-FREE NONDETERMINISTIC GENERALIZED MACHINE
C-FINITE LANGUAGE
EQUIVALENCE PROBLEM
EQUALITY PROBLEM

This publication has 0 references indexed in Scilit: