The minimum possible number of a deterministic finite automation that accepts the regular language L = {w1aw2 | w1, w2 ∈ {a,b}*, |w1| = 2,|w2| ≥ 3} […]
The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1) * (10) is __________. Correct Answer: A Question […]
Amongst the logic families DTL, TTL, ECL and CMOS, the family with the least power dissipation is : Correct Answer: A Question 10 Explanation: Emitter Coupled […]