UNSOLVABILITY OF EQUIVALENCE PROBLEM FOR LAMBDA-FREE NONDETERMINISTIC GENERALIZED MACHINES
UNSOLVABILITY OF EQUIVALENCE PROBLEM FOR LAMBDA-FREE NONDETERMINISTIC GENERALIZED MACHINES
复制标题
DOI：
10.1145/321466.321473
复制
发表时间：
1968-01-01
影响因子：
2.5
通讯作者：
GRIFFITHS, TV
中科院分区：
文献类型：
--
作者：
GRIFFITHS, TV
证明了A-free非确定广义机的等价问题是不可解的，并指出这一结果暗示了力有限语言的等价问题是不可解的.
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 forc-finite languages.