Simple Design of Automata

look a sample simple design of Automata:

Five tuple (Q,Σ,δ,q0,F):
Q	: states	:{q0,q1}
Σ	: alphabet (input)	:{0,1}
q0	: start states	: q0
F	: final/accept states	:{q1}
δ	: transition function	:

δ	0	1
q0	q1	{}
q1	{}	q0

A recognized string is a string that starts in the initial state and ends in the final state. 

For example:

The recognized string is:"0", "010", "01010",..., "0(10)*".

1). q0 -> q1= 0
2). q0 -> q1 -> q0 -> q1= 010
3)....