CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Consider the ...

Question

Consider the language, is divisible by 5} . which of the following is CORRECT statements with regards to L ?
$L = x^{l} y^{n} 2^{n} | (l + m + n)$

A

L is regular

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

L is CSL

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

L is CFL

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

L is recursive

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A L is regular
(d)
L is a mod 5 machine which can be design by finite automata. Hence L is regular .

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider the following statements regarding alphabet and language inequalities:

S_{1} : \sum^{*} - {ϵ} = \sum^{+}

S_{2} : L^{*} - {ϵ} = L^{*}

Which of the above statements are always true?

Q. Consider the following statements:

I. If L is the language accepted by some DPDA, then L has an unambiguous CFG.

II. PDA with acceptance by final state is equivalent to PDA with acceptance by empty stack.

Which of the above statements is correct?

Q. Consider the following problems L(G) denotes the language generated by a grammar G.L(M) denotes the language accepted by a machine M.
I. For an unrestricted grammar G and a string w, whether w

ϵ

L(G).
II. Given a Turing Machine M, whether L(M) is regular.
III. Given two grammars

G_{1} a n d G_{2},

(G_{1}) = L (G_{2})

.
IV. Given an NFA N, whether there is a deterministic PDA P such that N and P accept the same language.
Which one of the following statements is correct?

Q. Consider the language

L = {a^{n} | n > 0} \cup {a^{n} b^{n} | n \geq 0}

and the following statements.
I. L is determnistic context-free.
II. L is context-free but not deterministic context-free.
III. L is not LL(k) for any k.
Which of the above statements is/are TRUE?

Q. Consider the following language:

L = {x ϵ {a, b}^{*} ∣ n u m b e r o f a^{'} s i n x i s d i v i s i b l e b y 2 b u t n o t d i v i s i b l e b y 3}

The minimum number of states in a DFA that accepts L is

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Understanding Divisibility

Watch in App

Join BYJU'S Learning Program

CrossIcon