Abstract
PurposeThe purpose of this paper is to discuss the recognizability of Cantorian stochastic automata by generalized entropy‐like qualities.Design/methodology/approachThe 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.FindingsThe 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/valueThis 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 coding regions of chromosomes form Cantor sets.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference27 articles.
1. Allouche, J.‐P. (1987), “Automates finis en Mathématiques et en Physique”, Pour la Science, Vol. 114, p. 94.
2. Allouche, J.‐P. (1994), “Sur la complexité des suites infinies”, Bulletin of the Belgian Mathematical Society, Vol. 1, pp. 133‐43.
3. Allouche, J.‐P. (2000), “Algebraic and analytic randomness”, in Planat, M. (Ed.), Noise, Oscillators and Algebraic Randomness, Lecture Note in Physics, Vol. 550, Springer, Berlin, pp. 345‐56.
4. Allouche, J.‐P. and Shallit, J. (1999), “Sequences and their applications”, in Ding, C., Helleseth, T. and Niederreiter, H. (Eds), Proceedings of SETA ‘98, pp. 1‐16.
5. Allouche, J.‐P., Baake, M., Cassaigne, J. and Damanik, D. (2003), “Palindrome complexity”, Theoretical Computer Science, Vol. 292, pp. 9‐31.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献