You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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
The text was updated successfully, but these errors were encountered:
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:
Literature for references:
The text was updated successfully, but these errors were encountered: