Which one of the following regular expressions represents the set of all binary strings with an odd number of 1's?
Consider the following statements: 1. If L1 ∪ L2 is regular, then both L1 and L2 must be regular. 2. The class of regular language…
Which of the following languages are undecidable? Note that <M> indicates encoding of the Turing machine M. L1 = { <M> | L(M) = ∅ …
Consider the following languages: L1 = { w x y x | w, x, y ∈ (0 + 1)+ } L2 = { x y | x, y ∈ (a + b)*, |x| = |y|, x ≠ y } Which on…
Consider the language L = { x ∈ {a, b}* | number of a's in x is divisible by 2 but not divisible by 3 }. The minimum number of sta…
Consider the following grammar where S is the start symbol, and a and b are terminal symbols. S → aSbS | bS | ε Which of the follo…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.