Deterministic finite automaton

The main objective of the study is the abUily to analyze an identified model in identifying automaton models from observations. We want to take an established method to learn a DFA and apply it to our timed sequences. Our problem could be modelled as a timed-state transition graph, a probabilistic deterministic finite automaton (PDFA) taking into account timed-event. We also have a set of positive timed-strings (or time-stamped event sequences). 

Given a set of examples that are in the language (1+) and a (possibly empty) set of examples not in the language (I.), the task is to infer a deterministic finite automaton A that accepts the examples in 1+ and rejects the examples in I.. 

The SYMEL or PIPC computerized interlocking module has been developed to control the level of safety and reduce the costs of maintenance in operational condition. To do this, we defined a specification interpretation language, the deterministic finite state automaton (AEFD Automate a Etats Finis Deterministe) language. 

---