### Abstract

Probabilistic finite state automata (PFSA) are constructed from symbol sequences for modeling the behavior of dynamical systems. This paper presents construction of finite history automata from symbol sequences; such automata, called D-Markov machines, are structurally simple and computationally efficient. The construction procedure is based on: (i) state splitting that generates symbol blocks of different lengths according to their relative importance; and (ii) state merging that assimilates histories from symbol blocks leading to the same symbolic behavior. A metric on probability distribution of symbol blocks is introduced for trade-off between modeling performance and the number of PFSA states. These algorithms have been tested by two examples.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 2011 American Control Conference, ACC 2011 |

Pages | 5145-5150 |

Number of pages | 6 |

State | Published - Sep 29 2011 |

Event | 2011 American Control Conference, ACC 2011 - San Francisco, CA, United States Duration: Jun 29 2011 → Jul 1 2011 |

### Other

Other | 2011 American Control Conference, ACC 2011 |
---|---|

Country | United States |

City | San Francisco, CA |

Period | 6/29/11 → 7/1/11 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering

### Cite this

*Proceedings of the 2011 American Control Conference, ACC 2011*(pp. 5145-5150). [5990861]