Affiliation:
1. Air force Cambridge Research Laboratories, Bedford, Massachusetts
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference2 articles.
1. A variant of a recursively unsolvale problem. Bull. A,mer;Pos T, E;Math. Soc.,1946
Cited by
111 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献