December 10, 2024
Question 61 Consider the following two regular expressions over the alphabet {0,1}: r= 0*+1* s=01*+10* The total number of strings of length less than or equal […]
January 3, 2025
Question 18 Consider the languages L1,L2 and L3 as given below. L1 = {0p1q|p,q∈N}, L2 = {0p1q|p,q∈N and p=q} and L3 = {0p1q0r|p,q,r∈N and p=q=r}. Which […]
January 3, 2025
Question 19 A deterministic finite automation (DFA) D with alphabet Σ={a,b} is given below. Which of the following finite state machines is a valid minimal DFA […]
January 3, 2025
Question 20 Definition of a language L with alphabet {a} is given as following. L = {ank| k>0, and n is a positive integer constant} What […]