Purpose: The purpose of this paper is to discuss the recognizability of Cantorian stochastic automata by generalized entropy-like qualities. Design/methodology/approach: The paper gives a necessary entropy condition, valid for all sequences on the alphabet {0, 1} read by lumping and generated by a Cantorian stochastic automaton. Findings: The paper finds that, on this basis, once can determine that a given sequence is not generated by Cantorian stochastic automata and reconstruct the automaton when the sequence is generated by a Cantorian stochastic automaton. Originality/value: This paper derives a new diagnostic for Cantorian stochastic automata, which could find a direct application to biology, where there is a recent claim that the codi...
Motivation: Topological entropy has been one of the most difficult to implement of all the entropy-t...
We study random string-duplication systems, which we call Pólya string models. These are motivated b...
13 pages, 6 figures, LaTeX, v2: refs addedCellular automata (CA) consist of an array of identical ce...
The algorithms and equations that define and link circular coding properties of the genetic code and...
A given finite sequence of letters over a finite alphabet can always be algorithmically generated, i...
A detailed entropy analysis by the recent novelty of 'lumping' is performed in some DNA sequences. O...
We study the topological entropy of a particular class of dynamical systems: cellular automata. The ...
AbstractWe study the topological entropy of a particular class of dynamical systems: cellular automa...
A measure called physical complexity is established and calculated for a population of sequences, ba...
The topological entropy of cellular automata is general not computable. We identify and characterize...
Entropy based measures have been frequently used in symbolic sequence analysis. A symmetrized and sm...
The algorithms and equations that define and link circular coding properties of the genetic code and...
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under ...
Entropies. Several notions of entropies have been defined along the twentieth century. The role of a...
Abstract—A Motzkin shift is a mathematical model for constraints on genetic sequences. In terms of t...
Motivation: Topological entropy has been one of the most difficult to implement of all the entropy-t...
We study random string-duplication systems, which we call Pólya string models. These are motivated b...
13 pages, 6 figures, LaTeX, v2: refs addedCellular automata (CA) consist of an array of identical ce...
The algorithms and equations that define and link circular coding properties of the genetic code and...
A given finite sequence of letters over a finite alphabet can always be algorithmically generated, i...
A detailed entropy analysis by the recent novelty of 'lumping' is performed in some DNA sequences. O...
We study the topological entropy of a particular class of dynamical systems: cellular automata. The ...
AbstractWe study the topological entropy of a particular class of dynamical systems: cellular automa...
A measure called physical complexity is established and calculated for a population of sequences, ba...
The topological entropy of cellular automata is general not computable. We identify and characterize...
Entropy based measures have been frequently used in symbolic sequence analysis. A symmetrized and sm...
The algorithms and equations that define and link circular coding properties of the genetic code and...
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under ...
Entropies. Several notions of entropies have been defined along the twentieth century. The role of a...
Abstract—A Motzkin shift is a mathematical model for constraints on genetic sequences. In terms of t...
Motivation: Topological entropy has been one of the most difficult to implement of all the entropy-t...
We study random string-duplication systems, which we call Pólya string models. These are motivated b...
13 pages, 6 figures, LaTeX, v2: refs addedCellular automata (CA) consist of an array of identical ce...