𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Interface Automata with Complex Actions

✍ Scribed by Shahram Esmaeilsabzali; Farhad Mavaddat; Nancy A. Day

Book ID
108126643
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
350 KB
Volume
159
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Waiting time and complexity for matching
Waiting time and complexity for matching patterns with automata
✍ M. Crochemore; V.T. Stefanov πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 105 KB

The paper shows how to compute exactly expectations, standard deviations, and cumulative probabilities of the searching times of string-matching algorithms based on the use of automata. This is derived from a methodology based on viewing the underlying Markov chains as exponential families and apply