𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mathematical foundation of a new complexity measure

✍ Scribed by Shen En-hua; Cai Zhi-jie; Gu Fan-ji

Publisher
Springer
Year
2005
Tongue
English
Weight
453 KB
Volume
26
Category
Article
ISSN
0253-4827

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A statistical measure of complexity
A statistical measure of complexity
✍ R. LΓ³pez-Ruiz; H.L. Mancini; X. Calbet πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 504 KB
A statistical measure of complexity with
A statistical measure of complexity with nonextensive entropy
✍ Takuya Yamano πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 217 KB

A statistical measure of complexity utilising the concept of entropy or information is proposed. Our way in this study is to use a nonextensive entropy instead of an extensive (additive) Shannon entropy in the deÿnition, but can be characterised as a di erence between the qth-order RÃ enyi entropy a

Automaticity I: Properties of a Measure
Automaticity I: Properties of a Measure of Descriptional Complexity
✍ Jeffrey Shallit; Yuri Breitbart πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 668 KB

Let 7 and 2 be nonempty alphabets with 7 finite. Let f be a function mapping 7\* to 2. We explore the notion of automaticity, which attempts to model how ``close'' f is to a finite-state function. Formally, the automaticity of f is a function A f (n) which counts the minimum number of states in any