@inproceedings{7dbeef0f39e84bee87c69096cb69d21a,

title = "State splitting and state merging in probabilistic finite state automata",

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.",

author = "Patrick Adenis and Kushal Mukherjee and Asok Ray",

year = "2011",

doi = "10.1109/acc.2011.5990861",

language = "English (US)",

isbn = "9781457700804",

series = "Proceedings of the American Control Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "5145--5150",

booktitle = "Proceedings of the 2011 American Control Conference, ACC 2011",

address = "United States",

}