The Unsolvability of the Equivalence Problem for Lambda-Free Nondeterministic Generalized Machines

@article{Griffiths1968TheUO,
  title={The Unsolvability of the Equivalence Problem for Lambda-Free Nondeterministic Generalized Machines},
  author={Timothy V. Griffiths},
  journal={J. ACM},
  year={1968},
  volume={15},
  pages={409-413}
}
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. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
58 Extracted Citations
0 Extracted References
Similar Papers