Talk:A-level Computing 2009/AQA/Problem Solving, Programming, Data Representation and Practical Exercise/Problem Solving/Finite state machines

Show a finite state machine with input alphabet {0,1} which accepts any string having an odd number of 1’s and an odd number of 0’s.