𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Higher-ordered rules for symbolic substitution

✍ Scribed by S.P. Kozaitis

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
205 KB
Volume
65
Category
Article
ISSN
0030-4018

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A stopping rule for symbolic dynamic fil
A stopping rule for symbolic dynamic filtering
✍ Yicheng Wen; Asok Ray πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 263 KB

One of the key issues in symbolic dynamic filtering (SDF) is how to obtain a lower bound on the length of symbol blocks for computing the state probability vectors of probabilistic finite-state automata (PFSA). Having specified an absolute error bound at a confidence level, this short work formulate