The unsolvability of the equality problem for sentential forms of context-free grammars

Meera Blattner
1973 Journal of computer and system sciences (Print)  
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-marker. Three results which follow are: (i) The equality problem for sentential forms of c-finite grammars is unsolvable, and therefore the equality problem for the sentential forms of context-free
more » ... rs is unsolvable. (ii) The equality problem for sentential forms of bounded context-free grammars is unsolvable. (iii) The equality problem for OL-languages is unsolvable.
doi:10.1016/s0022-0000(73)80002-9 fatcat:6qla7qr74jbpfau5lwzoddjunq