Give a production grammar for the language L = {x/x ∈ (a,b)*, the nu – McqOptions

MCQOPTIONS

1.	Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.
A.	{S->bS,S->b,S->aA,S->bA,A->aB,B->bB,B->aS,S->a}
B.	{S->aS,S->bA,A->bB,B->bBa,B->bB}
C.	{S->aaS,S->bbA,A->bB,B->ba}
D.	None of the above
Answer» B. {S->aS,S->bA,A->bB,B->bBa,B->bB}

Discussion

No Comment Found

Related MCQs

What is the highest type number which can be applied to the following grammar? S —>Aa, A —> Ba, B —>abc
Consider a string s over (0+1)*. The number of 0’s in s is denoted by no(s) and the number of 1’s in s is denoted by n1(s). The language that is not regular is
Automaton accepting the regular expression of any number of a ' s is:
Consider a stack, which is limited to 10 items. The language accepted by a push- down automaton in such stack is best described as
Consider the following CFGS → aB S → bA**spaceB → b A → a**spaceB → bS A → aS**spaceB → aBB A → bAA**spaceConsider the following derivation**spaceS ⇒aB**space⇒aaBB**space⇒aaBb**space⇒aabSb**space⇒aabbAb**space⇒aabbab**spaceThis derivation is
The production Grammar is {S->aSbb,S->abb} is
A FSM can be considered, having finite tape length without rewinding capability and unidirectional tape movement
A Hamiltonian cycle in a Hamiltonian graph of order 24 has
Which of the following statements is/are FALSE?(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.(2) Turing recognizable languages are closed under union and complementation.(3) Turing decidable languages are closed under intersection and complementation(4) Turing recognizable languages are closed under union and intersection.
Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.