Which of the following is a regular language?

Which of the following languages are regular?A = {x | x has two 0’s separated by the number of positions that is a multiple of 4 }.B = {x | x is binary representation of multiple of 3}.C = {x | x is a binary string and decimal of any prefix of x is not of form 3m + 2, where m ≥ 0}.Select one:a. All of the mentioned.b. Only B and C. c. Only A.d. Only B.

Which of the following is a regular language? ans.String with substring wwr in betweenPalindrome stringString with even number of Zero’sString whose length is a sequence of prime numbers Previous Marked for Review Next

Which of the following is a Regular Language?~L={a^n b^ n |n>=0} =L={a^n b^ n |0=5}Select one:a. 1b. Lc. {a^n b^ n |n>

A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operationans.Kleene*All of the mentionedConcatenationUnion

Write regular expressions for the following languages.1. the set of all alphabetic strings;2. the set of all lower case alphabetic strings ending in a b;3. the set of all strings from the alphabet a, b such that each a is immedi-ately preceded by and immediately followed by a b