Q. Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:

View solution

Q. For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?

View solution

Q. Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?

View solution

Q. Given:
L= {xϵ∑= {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?

View solution

Q. How many languages are over the alphabet R?

View solution

Q. According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}
Statement 1: q ϵ Q’;
Statement 2: FϵQ

View solution

Q. δˆ tells us the best:

View solution

Q. Which of the following option is correct?
A= {{abc, aaba}. {ε, a, bb}}

View solution

Q. For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all the possible remainders?

View solution

Q. Given:
L1= {xϵ ∑*|x contains even no’s of 0’s}

L2= {xϵ ∑*|x contains odd no’s of 1’s}

Nunber of final states in Language L1 U L2?

View solution

Q. The maximum number of transition which can be performed over a state in a DFA?
∑= {a, b, c}

View solution

Q. The maximum sum of in degree and out degree over a state in a DFA can be determined as:
∑= {a, b, c, d}

View solution

Q. The sum of minimum and maximum number of final states for a DFA n states is equal to:

View solution

Q. There are ________ tuples in finite state machine.

View solution

Q. Transition function maps.

View solution

Q. Number of states require to accept string ends with 10.

View solution

Q. Extended transition function is .

View solution

Q. δ*(q,ya) is equivalent to .

View solution

Q. String X is accepted by finite automata if .

View solution

Q. Languages of a automata is

View solution