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 Citations (Scopus)

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 - 2011
Event2011 American Control Conference, ACC 2011 - San Francisco, CA, United States
Duration: Jun 29 2011Jul 1 2011

Other

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

Fingerprint

Finite automata
Vector spaces
White noise

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]
Wen, Yicheng ; Ray, Asok ; Chattopadhyay, Ishanu ; Phoha, Shashi. / Modeling of symbolic systems : Part I - Vector space representation of probabilistic finite state automata. Proceedings of the 2011 American Control Conference, ACC 2011. 2011. pp. 5133-5138
@inproceedings{2e3c25f367884e33bfa11ade91e1db29,
title = "Modeling of symbolic systems: Part I - Vector space representation of probabilistic finite state automata",
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.",
author = "Yicheng Wen and Asok Ray and Ishanu Chattopadhyay and Shashi Phoha",
year = "2011",
language = "English (US)",
isbn = "9781457700804",
pages = "5133--5138",
booktitle = "Proceedings of the 2011 American Control Conference, ACC 2011",

}

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., 5990763, pp. 5133-5138, 2011 American Control Conference, ACC 2011, San Francisco, CA, United States, 6/29/11.

Modeling of symbolic systems : Part I - Vector space representation of probabilistic finite state automata. / Wen, Yicheng; Ray, Asok; Chattopadhyay, Ishanu; Phoha, Shashi.

Proceedings of the 2011 American Control Conference, ACC 2011. 2011. p. 5133-5138 5990763.

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

TY - GEN

T1 - Modeling of symbolic systems

T2 - Part I - Vector space representation of probabilistic finite state automata

AU - Wen, Yicheng

AU - Ray, Asok

AU - Chattopadhyay, Ishanu

AU - Phoha, Shashi

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80053143393&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80053143393&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781457700804

SP - 5133

EP - 5138

BT - Proceedings of the 2011 American Control Conference, ACC 2011

ER -

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