1.

Design a deterministic finite automata for the given set: a) The set of strings w belongs to {0, 1}* such that number of 0’s is even and number of 1’s is a multiple of five.?

Answer»

q3: state of even number of 0's and odd number of 1's. EXAMPLE 4: Design FA with ∑ = {0, 1} ACCEPTS the set of all strings with THREE



Discussion

No Comment Found