An inner product space on irreducible and synchronizable probabilistic finite state automata

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 PFSA. This algebraic model formulation avoids any reference to the related notion of probability measures induced by a PFSA. A formal language-theoretic and symbolic modeling approach is adopted. Specifically, semantic models are constructed in the symbolic domain in an algebraic setting. Applicability of the theoretical formulation has been demonstrated on experimental data for robot motion recognition in a laboratory environment.

[1]  T. Raghavan,et al.  Nonnegative Matrices and Applications , 1997 .

[2]  Shalabh Gupta,et al.  Symbolic time series analysis of ultrasonic data for early detection of fatigue damage , 2007 .

[3]  T. Barfoot,et al.  An Algebra for the Control of Stochastic Systems : Exercises in Linear Algebra , 2002 .

[4]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[5]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  W. Rudin.  Real and complex analysis, 3rd ed. , 1987 .

[8]  A. Ray,et al.  Unsupervised inductive learning in symbolic sequences via Recursive Identification of Self-Similar Semantics , 2011, Proceedings of the 2011 American Control Conference.

[9]  Asok Ray,et al.  Structural transformations of probabilistic finite state machines , 2008, Int. J. Control.

[10]  Francisco Casacuberta,et al.  Probabilistic finite-state machines - part I , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Toshimitsu Masuzawa,et al.  On the synthesis of synchronizable finite state machines with partial scan , 1998, Systems and Computers in Japan.

[12]  Asok Ray,et al.  Symbolic time series analysis via wavelet-based partitioning , 2006, Signal Process..

[13]  Arthur Gill.  Applied algebra for the computer sciences , 1976 .

[14]  José Oncina,et al.  Learning Stochastic Regular Grammars by Means of a State Merging Method , 1994, ICGI.

[15]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[16]  W. Rudin.  Real and complex analysis , 1968 .

[17]  Xin Jin,et al.  Symbolic Dynamic Filtering and Language Measure for Behavior Identification of Mobile Robots , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[18]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[19]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[20]  Asok Ray,et al.  Modeling of symbolic systems: Part II - Hilbert space construction for model identification and order reduction , 2011, Proceedings of the 2011 American Control Conference.

[21]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[22]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[23]  Cosma Rohilla Shalizi,et al.  Blind Construction of Optimal Nonlinear Recursive Predictors for Discrete Sequences , 2004, UAI.

[24]  Dana Ron,et al.  On the learnability and usage of acyclic probabilistic finite automata , 1995, COLT '95.

[25]  Asok Ray,et al.  Statistical Mechanics of Complex Systems for Pattern Identification , 2009 .

[26]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[27]  Asok Ray,et al.  Symbolic dynamic analysis of complex systems for anomaly detection , 2004, Signal Process..

[28]  Asok Ray,et al.  Modeling of symbolic systems: Part I - Vector space representation of probabilistic finite state automata , 2011, Proceedings of the 2011 American Control Conference.

[29]  Mathukumalli Vidyasagar,et al.  The complete realization problem for hidden Markov models: a survey and some new results , 2011, Math. Control. Signals Syst..

[30]  A. Ray,et al.  Signed real measure of regular languages for discrete event supervisory control , 2005 .

[31]  Magnus Egerstedt,et al.  Special Section on Symbolic Methods for Complex Control Systems , 2006 .

[32]  Fernando Pereira,et al.  Aggregate and mixed-order Markov models for statistical language processing , 1997, EMNLP.

[33]  Thomas F. La Porta,et al.  Sensor Network Operations , 2006 .