Jean-Luc Ponty

  • Citations Per Year
Learn More
A nite-state machine is called a Thompson machine if it can be constructed from a regular expression using Thompson's construction. We call the underlying digraph of a Thompson machine a Thompson digraph. We characterize Thompson digraphs and, as one application of the characterization, we give an algorithm that generates an equivalent regular expression(More)
This paper presents the use of automata with multiplicities for the modelization of agent behaviours. Genetic algorithms can be defined on their probabilistic forms and are able to simulate adaptive behaviours. An application to a simulation of evolutive strategies in game theory is presented, specifically for the prisoner dilemma which is considered as a(More)
  • 1