States (name, accepting?) first state is starting
00,false 01,false 10,false 11,true
Transitions (starting state, character, destination state)
00,A,10 00,B,01 10,A,00 10,B,11 01,A,11 01,B,00 11,A,01 11,B,10
Maximum number of iterations
Maximum number of strings
Here are some links to DFAs that you may find interesting:
Strings with an odd number of As and Bs
Triples where the first two binary numbers add to the third
Binary numbers divisible by 7
Decimal numbers divisible by 7
Run a DFA! (It can do NFAs and epsilon-NFAs, too, but some strings might be duplicated in the output.)