Regular paper
On the fragmentary complexity of symbolic sequences

https://doi.org/10.1016/0304-3975(94)00261-GGet rights and content
Under an Elsevier user license
open archive

Abstract

A measure of the ability of a symbolic sequence to be covered by initial fragments of another symbolic sequence is introduced and its basic properties are investigated. Applications to the characterization of symbolic sequences associated with shift mappings on a torus corresponding to a special partitioning of the torus and to multirate systems of coprocessors are considered.

Cited by (0)

1

Supported by the Australian Research Council Grant A 8913 2609.

2

Partially supported by the Russian Foundation for Fundamental Research Grant 93012884.