THE UNSOLVABILITY OF THE EQUIVALENCE PROBLEM FOR LAMBDA-FREE NONDETERMINISTIC GENERALIZED MACHINES.
Abstract
We show that the equivalence problem for Lambda-free nondeterministic generalized machines is unsolvable and observe that this result implies the unsolvability of the equality problem for c-finite languages. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1968
- Accession Number
- AD0667209
Entities
People
- T. V. Griffiths
Organizations
- Air Force Cambridge Research Laboratories