Question: For each language given, write REG if the language is regular, write CF not REG if the language is context-free but not regular, write R
For each language given, write "REG" if the language is regular, write "CF not REG" if the language is context-free but not regular, write "R not CF" if the language is recursive but not context free, write "RE not R" if the language is recursively enumerable but not recursive, and write "not RE" if the language is not recursively enumerable.
(a) The set of all strings over the alphabet {a, b, c} where are not of the form anbncn
(b) The 0-1 Traveling Sales man Problem
(c) The diagonal language
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
