Consider the following languages over the binary alphabet
{a, b}: L:={a^nb^m:n≥m}
Answer if it is regular or not, and prove it, and explain.
Consider the following languages over the binary alphabet {a, b}: L:={a^nb^m:n≥m} Answer if it is regular...
Construct regular expressions for the following languages over the alphabet {a, b}: a. Strings that do not begin with an “a”. b. Strings that contain both aa and bb as substrings.
Give a regular expression generating the following languages over the alphabet {a,b}: {w | w is any string except aa and bbb}
For each of the following statements, where L1, L2, and L are languages over some alphabet Σ, state whether it is true or false. Prove your answer. • ∀L,(∅ or L+) = L∗ • ∀L1,L2,(L1 or L2)∗ = (L2 or L1)∗
3) Construct a regular expression defining each of the following languages over the alphabet {a, b}. (a) L = {aab, ba, bb, baab}; (b) The language of all strings containing exactly two b's. (c) The language of all strings containing at least one a and at least one b. (d) The language of all strings that do not end with ba. (e) The language of all strings that do not containing the substring bb. (f) The language of all strings...
5. Prove that the following languages are not regular: (a) L = {a"bak-k < n+1). (b) L-(angla": kメn + 1). (c) L = {anglak : n = l or l k} . (d) L = {anb : n2 1} L = {w : na (w)关nb (w)). "(f) L = {ww : w E {a, b)'). (g) L = {w"www" : w E {a,b}*}
Prove that each of the following languages is not regular A) L= {a^n b^m c^k : k = 2n + 3m and n, m, k ≥ 0} B) L = {a^n : n is a power of 5}
Answer these questions Construct regular expressions for the following languages: i. Even binary numbers without leading zeros ii, L-(a"b"(n + m) is odd) ii L fa"b"l. n 2 3, m is odd) ni m.
8 Find CFGs that for these regular languages over the alphabet a, b. Draw a Finite Automata first and use this to create the CFG (a) The language of all words that consist only of double letters (aa or bb) (b) The set of all words that begin with the letter b and contains an odd number of a's or begin with the letter a and contains an even number of b's.
(3) Consider the following three languages over the alphabet Σ default i,j, k, are non-negative integers (can be 0): (a,b,c,d), where by One of these is not a CFL; the other two are CFLs. Give context-free grammars for the two that are CFLs, and a CFL Pumping Lemma proof for the one that is not a CFL. (You need not prove your grammars correct, but their plan should be clear. (6+6+18 30 pts., for 74 total on the set) (3)...
This is from CS 4110 1. Find CFGs that generate these regular languages over the alphabet 2 - la bl: (i) The language defined by (aaa + b)*. (iv) All strings that end in b and have an even number of b's in total (vi) All strings with exactly one a or exactly one b.