Related MCQs

• Consider the following deterministic finite state automaton M.S denotes the set of seven bit in which the 1st ,4th and last bits are 1. The number of strings that are accepted by M is
• Consider the machine M: The language recognized by M is :
• The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _____________a*b*(ba)*a*
• Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences of (110)’s as (011)’s}.Let L2 = { ∈ {0,1}∗ | w has at least as many occurrences of (000)’s as (111)’s}.Which one of the following is TRUE?
• Which of the regular expressions given below represent the following DFA?I) 0*1(1+00*1)*II) 0*1*1+11*0*1III) (0+1)*1
• The minimum state automation equivalent to the below FSA has the following number of states?
• The language accepted by this DFA is?