Learn More
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(More)
Probabilistic finite state automata (PFSA) have found their applications in diverse systems. This paper presents the construction of an inner-product space structure on a class of PFSA over the real field via an algebraic approach. The vector space is constructed in a stationary setting, which eliminates the need for an initial state in the specification of(More)
  • 1