Q. Consider the following finite state machine. This machine outputs as

View solution

Q. The smallest finite automata which accepts the language {X: X is a word over {a, b} and |x| is Divisible by 3} has

View solution

Q. Which of the following is correct?

View solution

Q. If a NFA N = (Q,Σ,δ,S,F) and the equilanet DFA D = (Q,Σ,δ,S,F), then which of the following is incorrect?

View solution

Q. Complement of (a + b)* will be

View solution

Q. a ^ nb ^ m where n >= 1, m >= 1, nm >= 3 is example of

View solution

Q. Complement of a ^ nb ^ m where n >= 4 and m <= 3 is example of

View solution

Q. a ^ nb ^ n where (n+m) is even .

View solution

Q. Which of the following is type 3 language ?

View solution

Q. (a ^ 5b ^ 5)* is example of ________

View solution

Q. Homomorphism of a regular set is _______

View solution

Q. A ___________ is a substitution such that h(a) contains a string for each a.

View solution

Q. Reverse of (0+1)* will be

View solution

Q. Reverse of a DFA can be formed by

View solution

Q. If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be

View solution

Q. If L1 and L2 are regular sets then intersection of these two will be

View solution

Q. Complement of regular sets are _________

View solution

Q. Complement of a DFA can be obtained by

View solution

Q. Regular sets are closed under union,concatenation and kleene closure.

View solution

Q. The number of final states we need as per the given language?
Language L: {an| n is even or divisible by 3}

View solution