1. L . LR = {xy | x ϵ L, yR ϵ L}
  2. {wwR | w ϵ L}
  3. Prefix (L) = {x ϵ ∑* | ∃x ϵ ∑* such that xy ϵ L}
  4. Suffix (L) = {y ϵ ∑* | ∃x ϵ ∑* such that xy ϵ L}
4 views

1 Answers

Option 2 : {wwR | w ϵ L}

  • Non-deterministic push down automata (NPDA) determines the middle position of the string in the language and start popping until Z(end of stack elements) is meet to tell the acceptance of it .
  • As all the string present in the language wwR accepted by NPDA Hence it is a context free language (CFL).
  • From the properties of regular language: Reverse, Suffix, Prefix, Concatenation of Regular language is Regular.
  • Every regular language is context free language, but every context free language is not a regular language also wwR it is not possible to give, DFA, NFA or ϵ - NFA accepting the language. Therefore, it is not Regular language.
4 views

Related Questions