Let L1, L2 be two regular languages and L3 a language which is not regular. Which of the following statements is/are always TRUE?

Let G = (V, Σ, S, P) be a context-free grammar in Chomsky Normal Form with Σ = {a,b,c} and V containing 10 variable symbols includ…

Consider the following two regular expressions over the alphabet {0,1}: r = 0* + 1* s = 01* + 10* The total number of strings of l…

Let M be the 5-state NFA with ε-transitions shown in the diagram below: state1 is the start state, with ε-transitions to state2 an…

Consider a context-free grammar G with the following 3 rules. S → aS, S → aSbS, S → c Let w be in L(G). Let na(w), nb(w), nc(w) de…

Let L1 be the language represented by the regular expression b*ab*(ab*ab*)* and L2 = { w in (a+b)* | |w| ≤ 4 }, where |w| denotes …