Implement evolution of Finite State Automata graphs

Finite State Automata (FSA) also called Finite State Machines (FSM) is a very interesting application area with deep roots in Genetic Programming field.

Some directions on implementation:
- Good application of FSA is *game theory* -- evolution can consider a population of competing game strategies, e.g. for Prisoner Dilemma
- Simpler application of FSA is generation of a certain output sequence from a certain input sequence
- Possibly there exist good libraries for simulating FSA, and it will be enough to just write an Adapter for it

Literature for references:
- Dan Simon, "Evolutionary Optimization Algorithms", chapter 5