Modeling of symbolic systems: Part I - Vector space representation of probabilistic finite state automata

Yicheng Wen, Asok Ray, Ishanu Chattopadhyay, Shashi Phoha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

This paper, which is the first of two parts, brings in the notions of vector addition and the associated scalar multiplication operations on probabilistic finite state automata (PFSA). A class of PFSA is shown to constitute a vector space over the real field ℝ, where the zero element is semantically equivalent to a subclass of PFSA, referred to as symbolic white noise. A norm is introduced on the vector space of PFSA and it quantifies the non-probabilistic behavior of a PFSA. The second part constructs a family of inner products on this vector space and presents numerical examples and applications.

Original languageEnglish (US)
Title of host publicationProceedings of the 2011 American Control Conference, ACC 2011
Pages5133-5138
Number of pages6
StatePublished - Sep 29 2011
Event2011 American Control Conference, ACC 2011 - San Francisco, CA, United States
Duration: Jun 29 2011Jul 1 2011

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2011 American Control Conference, ACC 2011
CountryUnited States
CitySan Francisco, CA
Period6/29/117/1/11

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Wen, Y., Ray, A., Chattopadhyay, I., & Phoha, S. (2011). Modeling of symbolic systems: Part I - Vector space representation of probabilistic finite state automata. In Proceedings of the 2011 American Control Conference, ACC 2011 (pp. 5133-5138). [5990763] (Proceedings of the American Control Conference).