State splitting and state merging in probabilistic finite state automata

Probabilistic finite state automata (PΓSA) 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 eff...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Adenis, Patrick, Mukherjee, Kushal, Ray, Asok
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Automata D-Markov Machines Entropy History Markov processes Measurement Merging Probabilistic Finite State Automata Probabilistic logic State Merging State Splitting Symbolic Dynamics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!