Q. Reverse of a DFA can be formed by

View solution

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

View solution

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

View solution

Q. Homomorphism of a regular set is _______

View solution

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

View solution

Q. Which of the following is type 3 language ?

View solution

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

View solution

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

View solution

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

View solution

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

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. Which of the following is correct?

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. Consider the following finite state machine. This machine outputs as

View solution

Q. The major difference between a Moore and a mealy machine is that

View solution

Q. If an input string W has n symbols and can be recognized by a mealy machine M₁ and equivalent Moore machine M₂ then number of output symbols by M₁ and M₂ are respectively?

View solution

Q. If the input is null, the output produced by a mealy machine is

View solution

Q. For input null the output produced by a Moore machine is

View solution