If G is “S → a S/a”, then L(G) = ?

Related MCQs

• If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be
• If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be
• If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
• If G is a connected planar graph of v vertices e edges and r regions then
• If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
• P, Q, R are three languages. If P & R are regular and if PQ=R, then
• Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
• Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
• Let L be a language defined over an alphabet ∑,then the language of strings , defined over ∑, not belonging to L denoted by LC or L. is called :
• If PCP is decidable then MPCP is