Solved

Consider the Following Language L = {Anbncndn N ? 1}

Question 15

Multiple Choice

Consider the following language L = {anbncndn n ? 1} L is

A) CFL but not regular
B) CSL but not CFL
C) Regular
D) Type 0 language but not type 1

Related Questions

Q10: Let L1 = {w ? {0,1}? |

Q11: Regular expressions are A)Type 0 language B)Type 1 language C)Type

Q12: Let w be any string of length

Q13: Consider the regular language L = (111+111111)*.

Q14: Which of the following is TRUE? A)Every subset

Q16: If G is a simple connected 3-regular

Q17: A spanning tree for a simple graph

Q18: If G is a simple connected 3-regular

Q19: The following grammar G = (N, T, P,

Q20: Two strings x and y are indistinguishable