Discretized Markov transformations - An example of ultradiscrete dynamical systems
Search this article
Description
We define discretized Markov transformations and find an algorithm to give the number of maximal-period sequences based on discretized Markov transformations. In this report, we focus on the discretized dyadic transformations and the discretized golden mean transformations. Then we find an algorithm to give the number of maximal-period sequences based on these discretized transformations. Moreover, we define a number-theoretic function related to the numbers of maximal-period sequences based on these discretized transformations. We also introduce the entropy of the maximal-period sequences based on these discretized transformations. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers.
Journal
-
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
-
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A (10), 2684-2691, 2005-10-01
IEICE 電子情報通信学会
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1050564285889974272
-
- NII Article ID
- 110003213286
-
- NII Book ID
- AN10467885
-
- ISSN
- 09168508
- 17451337
-
- HANDLE
- 2297/24656
-
- Text Lang
- en
-
- Article Type
- journal article
-
- Data Source
-
- IRDB
- Crossref
- CiNii Articles
- OpenAIRE