Which regular grammar generates the language consisting of strings with zero or more occurrences of "a" followed by "b"? Options : S -> ab | aS | ε S -> a | b | aS S -> ab | aS none

Which regular grammar generates the language consisting of strings containing "aba" or "abb"? Options : S -> a | b | aS | bS S -> abS | abbS | ε S -> abaS | abbS | ε none

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

You have a context-free grammar (CFG) defined as follows:S → aSbS → εWhich of the following strings is generated by this CFG?1 point"aabbb""aaabb""ab""bbb"

Find regular grammars for the following languages on {a, b}:(a) L = {w : na(w) is even, nb(w) ≥ 4}

Which language accepted by the regular expression (0+1)*0(0+1)*0(0+1)*.Select one:a. The set of all strings containing at least two 0’s.b. The set of all strings that begin and end with either 0 or 1.c. The set of all strings containing at most two 0’s.d. The set of all strings containing the substring 00.