Vector space formulation of probabilistic finite state automata

DOI10.1016/j.jcss.2012.02.001zbMath1244.68048MaRDI QIDQ439977

J. Herrera, H. S. Yoon

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.02.001

zbMATH Keywords

pattern recognition; probabilistic finite state automata; normed vector space

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata

Uses Software

• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete realization problem for hidden Markov models: a survey and some new results
• Wavelet-based feature extraction using probabilistic finite state automata for pattern classification
• Symbolic dynamic analysis of complex systems for anomaly detection
• On the learnability and usage of acyclic probabilistic finite automata
• Structural transformations of probabilistic finite state machines
• Symbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations
• A Parametric Copula-Based Framework for Hypothesis Testing Using Heterogeneous Data
• An Introduction to Symbolic Dynamics and Coding
• Elements of Information Theory
• Signed real measure of regular languages for discrete event supervisory control