The unsolvability of the equality proble
โ
Meera Blattner
๐
Article
๐
1973
๐
Elsevier Science
๐
English
โ 258 KB
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable. It is shown here that the equivalence problem for these machines can be reduced to the equality problem of the sentential forms of a particular type of linear context-free grammars with a center-mark