Hello. I got my theory of computation exam day after and I am having difficulty in solving problems involving construction of deterministic finite automaton.
The problems are of the following manner.
Give deterministic automaton accepting the following languages over the alphabet {0,1} 1)Number of 1s is even and number of 0's is odd. 2)All strings with exactly two 1s 3)Containing at least two 0s And so on.
My question is how exactly do you people visualize such kind of problems? What's your approach? Anything which can help me?
[link][7 comments]