Computer Science, asked by Maruf9750, 9 months ago

Q the language l is defined as (gate-2017) (1 marks) l = {an bn cm dm | m, n 1} l = {an bm cm dn | m, n 1} otherwise then the language l is best described as a) regular b) context-free but not regular c) context-sensitive but not context-free d) no one decide until the will be declared

Answers

Answered by mousumi795
0

Answer:

ndjjabzbdvxhshdvdbbdbf f8736r6e8w887646e377ehbdbdjdbxjwsjfbnxjw8wue................jjcjর

Similar questions