Question: 3. Consider the language C over the alphabet a, b, cy consisting of all strings of the form a,b,e*, where i, j, K 0 and

3. Consider the language C over the alphabet a, b, cy consisting of all strings of the form a,b,e*, where i, j, K 0 and either i-j or j-k. Is L regular? Is it context-free? Justify your answers
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
