Pub Date : 2024-03-15DOI: 10.25088/complexsystems.32.4.395
Savino Longo
Simple rewriting rules are used to produce alphanumeric strings that embed fractal number sequences and are directly translatable into descriptions of hydrocarbon structures of considerable complexity, featuring hierarchical schemes. Rotations of the alphanumeric strings lead to radical rearrangements of the corresponding structures, which lose their initial schemes and become much less predictable, featuring different topologies of polygonal cycles. This shows that a complex and not necessarily ordered molecular structure may nevertheless have a relatively low algorithmic complexity. The variety and versatility of reorganization in chemical topology, due to the nonlocal representation of bonds in the coding string, may have played a role in prebiotic chemistry.
{"title":"Formal Grammars Generating Fractal Descriptions of Molecular Structures","authors":"Savino Longo","doi":"10.25088/complexsystems.32.4.395","DOIUrl":"https://doi.org/10.25088/complexsystems.32.4.395","url":null,"abstract":"Simple rewriting rules are used to produce alphanumeric strings that embed fractal number sequences and are directly translatable into descriptions of hydrocarbon structures of considerable complexity, featuring hierarchical schemes. Rotations of the alphanumeric strings lead to radical rearrangements of the corresponding structures, which lose their initial schemes and become much less predictable, featuring different topologies of polygonal cycles. This shows that a complex and not necessarily ordered molecular structure may nevertheless have a relatively low algorithmic complexity. The variety and versatility of reorganization in chemical topology, due to the nonlocal representation of bonds in the coding string, may have played a role in prebiotic chemistry.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140239188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-15DOI: 10.25088/complexsystems.32.4.353
Patrik Christen
Having a model and being able to implement open-ended evolutionary systems is important for advancing our understanding of open-endedness. Complex systems science and the newest generation high-level programming languages provide intriguing possibilities to do so. Here, some recent advances in modeling and implementing open-ended evolutionary systems are reviewed (an earlier and shorter version was presented at [1]). Then, the so-called allagmatic method is introduced as a computational framework that describes, models, implements and allows interpreting complex systems using system metamodeling. Based on recent advances, the model building blocks evolving entities, entity lifetime parameter, co-evolutionary operations of entities and environment and combinatorial interactions are identified to characterize open-ended evolutionary systems. They are formalized within the system metamodel, providing a formal description of an open-ended evolutionary system. The study further provides a self-modifying code prototype in C# and guidance to create code blocks for an intrinsic implementation of open-ended evolutionary systems. This is achieved by controlling the self-modification of program code within the abstractly defined building blocks of the system metamodel. It is concluded that the identified model building blocks and the proposed self-modifying code provide a promising starting point to model and implement open-endedness in a computational system that potentially allows us to interpret novelties at runtime.
{"title":"System Metamodeling of Open-Ended Evolution Implemented with Self-Modifying Code","authors":"Patrik Christen","doi":"10.25088/complexsystems.32.4.353","DOIUrl":"https://doi.org/10.25088/complexsystems.32.4.353","url":null,"abstract":"Having a model and being able to implement open-ended evolutionary systems is important for advancing our understanding of open-endedness. Complex systems science and the newest generation high-level programming languages provide intriguing possibilities to do so. Here, some recent advances in modeling and implementing open-ended evolutionary systems are reviewed (an earlier and shorter version was presented at [1]). Then, the so-called allagmatic method is introduced as a computational framework that describes, models, implements and allows interpreting complex systems using system metamodeling. Based on recent advances, the model building blocks evolving entities, entity lifetime parameter, co-evolutionary operations of entities and environment and combinatorial interactions are identified to characterize open-ended evolutionary systems. They are formalized within the system metamodel, providing a formal description of an open-ended evolutionary system. The study further provides a self-modifying code prototype in C# and guidance to create code blocks for an intrinsic implementation of open-ended evolutionary systems. This is achieved by controlling the self-modification of program code within the abstractly defined building blocks of the system metamodel. It is concluded that the identified model building blocks and the proposed self-modifying code provide a promising starting point to model and implement open-endedness in a computational system that potentially allows us to interpret novelties at runtime.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140237805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-15DOI: 10.25088/complexsystems.32.4.381
Luan Carlos de Sena Monteiro Ozelim, André Luís Brasil Cavalcante, Todd Rowland, Jan M. Baetens
The evolution of universal systems has been of great interest to computer scientists. In particular, the role of Turing machines in the study of computational universality is widely recognized. Even though the patterns emerging from the evolution of this kind of dynamical system have been studied in much detail, the transition functions themselves have received less attention. In the present paper, the iota-delta function is used to encode the transition function of one-head Turing machines. In order to illustrate the methodology, we describe the transition functions of two universal Turing machines in terms of the latter function. By using the iota-delta function in this setting, Turing machines can be represented as a system of transition functions. This new representation allows us to write the transition functions as a linear combination of evolution variables wrapped by the iota-delta function. Thus, the nonlinear part of the evolution is totally described by the iota-delta function.
{"title":"An Alternative Representation of Turing Machines by Means of the Iota-Delta Function","authors":"Luan Carlos de Sena Monteiro Ozelim, André Luís Brasil Cavalcante, Todd Rowland, Jan M. Baetens","doi":"10.25088/complexsystems.32.4.381","DOIUrl":"https://doi.org/10.25088/complexsystems.32.4.381","url":null,"abstract":"The evolution of universal systems has been of great interest to computer scientists. In particular, the role of Turing machines in the study of computational universality is widely recognized. Even though the patterns emerging from the evolution of this kind of dynamical system have been studied in much detail, the transition functions themselves have received less attention. In the present paper, the iota-delta function is used to encode the transition function of one-head Turing machines. In order to illustrate the methodology, we describe the transition functions of two universal Turing machines in terms of the latter function. By using the iota-delta function in this setting, Turing machines can be represented as a system of transition functions. This new representation allows us to write the transition functions as a linear combination of evolution variables wrapped by the iota-delta function. Thus, the nonlinear part of the evolution is totally described by the iota-delta function.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140240840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-15DOI: 10.25088/complexsystems.32.2.189
R. S. Subramanian, R. S. Shree, P. G. Kubendran Amos
A polycrystalline system corroborating experimentally observed microstructure is developed in this paper by employing cellular automata techniques. Moreover, through appropriate transition functions, microstructural changes accompanying dynamic recrystallization, a manufacturing technique associated with the production of a wide range of components, is simulated. The grain growth that characterizes this change is analyzed to explicate the trend in the temporal evolution of mean grain size and its kinetics. As opposed to a progressive increase in mean grain size, which generally typifies a conventional grain growth, in dynamic recrystallization it is observed that the mean grain size increases and decreases sequentially, thereby rendering an oscillating pattern. A perceptive investigation of the fluctuating trend unravels individual growth events, characterized by monotonic increase in mean grain size, whose kinetics follows the third-order power law. Additionally, the existing approach of modeling dynamic recrystallization is extended to facilitate unrestricted yet energetically favored growth of defect-free nuclei across their neighboring grains.
{"title":"Analyzing and Extending Cellular Automaton Simulations of Dynamic Recrystallization","authors":"R. S. Subramanian, R. S. Shree, P. G. Kubendran Amos","doi":"10.25088/complexsystems.32.2.189","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.189","url":null,"abstract":"A polycrystalline system corroborating experimentally observed microstructure is developed in this paper by employing cellular automata techniques. Moreover, through appropriate transition functions, microstructural changes accompanying dynamic recrystallization, a manufacturing technique associated with the production of a wide range of components, is simulated. The grain growth that characterizes this change is analyzed to explicate the trend in the temporal evolution of mean grain size and its kinetics. As opposed to a progressive increase in mean grain size, which generally typifies a conventional grain growth, in dynamic recrystallization it is observed that the mean grain size increases and decreases sequentially, thereby rendering an oscillating pattern. A perceptive investigation of the fluctuating trend unravels individual growth events, characterized by monotonic increase in mean grain size, whose kinetics follows the third-order power law. Additionally, the existing approach of modeling dynamic recrystallization is extended to facilitate unrestricted yet energetically favored growth of defect-free nuclei across their neighboring grains.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-15DOI: 10.25088/complexsystems.32.2.101
Soumyadeep Paty, Supreeti Kamilya
A significant contribution to the economic growth of a nation comes from the mineral industries. Therefore, the concentration of metallic or nonmetallic minerals in different regions of Earth’s crust is important to determine. The present paper studies the grade and thickness estimation of iron and coal deposits, respectively, by applying two-dimensional cellular automata (CAs). Krigging is a popular method for the estimation of mineral resources. However, krigging results in complex mathematical calculations if the number of sample points increases. Here, each cell of the cellular automaton (CA) is represented as a block. Using CAs, the grade values and thickness are estimated in a simpler and faster way. Two-dimensional CAs are used in this paper where the local rule is the ordinary krigging estimator function using the spherical variogram model. The total weight of iron as well as coal is calculated using the CA-based technique. A comparative analysis between the estimated weight of minerals and the actual extracted mineral is also given.
{"title":"A Cellular Automaton-Based Technique for Estimating Mineral Resources","authors":"Soumyadeep Paty, Supreeti Kamilya","doi":"10.25088/complexsystems.32.2.101","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.101","url":null,"abstract":"A significant contribution to the economic growth of a nation comes from the mineral industries. Therefore, the concentration of metallic or nonmetallic minerals in different regions of Earth’s crust is important to determine. The present paper studies the grade and thickness estimation of iron and coal deposits, respectively, by applying two-dimensional cellular automata (CAs). Krigging is a popular method for the estimation of mineral resources. However, krigging results in complex mathematical calculations if the number of sample points increases. Here, each cell of the cellular automaton (CA) is represented as a block. Using CAs, the grade values and thickness are estimated in a simpler and faster way. Two-dimensional CAs are used in this paper where the local rule is the ordinary krigging estimator function using the spherical variogram model. The total weight of iron as well as coal is calculated using the CA-based technique. A comparative analysis between the estimated weight of minerals and the actual extracted mineral is also given.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-15DOI: 10.25088/complexsystems.32.2.171
Anita John, Jimmy Jose
In today’s world of pervasive computing, all the devices have become smart. The need for securing these devices becomes a need of the hour. The traditional cryptographic algorithms will not be ideal for small devices, and this opens a new area of cryptography named lightweight cryptography, which focuses on the implementation of cryptographic algorithms in resource-constrained devices without compromise in security. Cryptographic hash functions enable detection of message tampering by adversaries. This paper proposes a lightweight hash function that makes use of sponge functions and higher radii hybrid cellular automata (CAs). The proposed hash function shows good cryptographic properties as well as collision resistance and serves as an ideal hash function for lightweight applications.
{"title":"Hash Function Design Based on Hybrid Five-Neighborhood Cellular Automata and Sponge Functions","authors":"Anita John, Jimmy Jose","doi":"10.25088/complexsystems.32.2.171","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.171","url":null,"abstract":"In today’s world of pervasive computing, all the devices have become smart. The need for securing these devices becomes a need of the hour. The traditional cryptographic algorithms will not be ideal for small devices, and this opens a new area of cryptography named lightweight cryptography, which focuses on the implementation of cryptographic algorithms in resource-constrained devices without compromise in security. Cryptographic hash functions enable detection of message tampering by adversaries. This paper proposes a lightweight hash function that makes use of sponge functions and higher radii hybrid cellular automata (CAs). The proposed hash function shows good cryptographic properties as well as collision resistance and serves as an ideal hash function for lightweight applications.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-15DOI: 10.25088/complexsystems.32.2.i
Sukanta Das, Genaro J. Martínez
This special issue contains six papers that are the extended versions of six selected contributions that were presented at the First Asian Symposium on Cellular Automata Technology, 2022 (ASCAT 2022). The symposium was officially organized by the departments of Information Technology and Computer Science and Technology, Indian Institute of Engineering Science and Technology, Shibpur (IIEST, Shibpur), India, March 3–5, 2022, in online mode. Cellular Automata India (https://www.cellularautomata.in) is an open research group that was created during the pandemic period by a group of Indian researchers and took a leading role in organizing the event. There are a number of international conferences and workshops that consider cellular automata as the primary theme and deal with various aspects of cellular automata and their theoretical, modeling and application development issues. Since the late 1980s, cellular automata have been used to devise solutions for technological problems, particularly in the domain of very large-scale integration (VLSI) design and test, pattern recognition and classification, security and image processing. The aim of this symposium was to focus on the issue of technology development by cellular automata. In our view, ASCAT was the first event of this kind. Since technology cannot mature without a solid theoretical base, this symposium invited theoreticians and engineers to exchange their views and ideas. In this symposium, 14 papers were selected for presentation. We invited all the authors of the 14 papers to submit extended versions of their works for inclusion in the planned special issue. The submitted extended versions were reviewed again and finally six papers were chosen for this special issue. We thank all the authors of this issue for their efforts to beautifully extend their research. We are very greatly thankful to the reviewers who gave their efforts to review the papers and to select these six papers. We hope that these papers will be a good contribution to the field of cellular automata.
{"title":"Special Issue: Selected Papers from the First Asian Symposium on Cellular Automata Technology, 2022 (ASCAT 2022)","authors":"Sukanta Das, Genaro J. Martínez","doi":"10.25088/complexsystems.32.2.i","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.i","url":null,"abstract":"This special issue contains six papers that are the extended versions of six selected contributions that were presented at the First Asian Symposium on Cellular Automata Technology, 2022 (ASCAT 2022). The symposium was officially organized by the departments of Information Technology and Computer Science and Technology, Indian Institute of Engineering Science and Technology, Shibpur (IIEST, Shibpur), India, March 3–5, 2022, in online mode. Cellular Automata India (https://www.cellularautomata.in) is an open research group that was created during the pandemic period by a group of Indian researchers and took a leading role in organizing the event. There are a number of international conferences and workshops that consider cellular automata as the primary theme and deal with various aspects of cellular automata and their theoretical, modeling and application development issues. Since the late 1980s, cellular automata have been used to devise solutions for technological problems, particularly in the domain of very large-scale integration (VLSI) design and test, pattern recognition and classification, security and image processing. The aim of this symposium was to focus on the issue of technology development by cellular automata. In our view, ASCAT was the first event of this kind. Since technology cannot mature without a solid theoretical base, this symposium invited theoreticians and engineers to exchange their views and ideas. In this symposium, 14 papers were selected for presentation. We invited all the authors of the 14 papers to submit extended versions of their works for inclusion in the planned special issue. The submitted extended versions were reviewed again and finally six papers were chosen for this special issue. We thank all the authors of this issue for their efforts to beautifully extend their research. We are very greatly thankful to the reviewers who gave their efforts to review the papers and to select these six papers. We hope that these papers will be a good contribution to the field of cellular automata.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-15DOI: 10.25088/complexsystems.32.2.211
Daiki Suzuki, Sho Tsugawa
Analyzing the structures of multilayer networks (MLNs) has been a hot research topic in network science. Community detection algorithms are important tools for analyzing MLNs. In the literature, several community detection algorithms for MLNs have been proposed. Moreover, there are several options for the graph representation of an MLN: for example, directed or undirected, weighted or unweighted, and using information from all or only some layers. Although these options may affect the results of community detection in MLNs, representations that are effective for community detection have not yet been clarified. In this paper, we experimentally evaluate the effectiveness of three types of community detection algorithms for MLNs and examine how the graph representation of an MLN affects the results of these algorithms. Our main findings are as follows: (1) The flattening approach is particularly effective, whereas the layer-by-layer approach is not applicable to detecting communities in MLNs of Twitter users. (2) Using a directed graph for each layer of an MLN increases the accuracy of community detection. (3) The Leiden method, which is a community detection algorithm for single-layer networks, achieves comparable accuracy with the community detection algorithms for MLNs, which suggests that there exists room for improvement in multilayer community detection algorithms for effectively utilizing the multilayer structures of MLNs.
{"title":"Evaluating Community Detection Algorithms for Multilayer Networks: Effectiveness of Link Weights and Link Direction","authors":"Daiki Suzuki, Sho Tsugawa","doi":"10.25088/complexsystems.32.2.211","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.211","url":null,"abstract":"Analyzing the structures of multilayer networks (MLNs) has been a hot research topic in network science. Community detection algorithms are important tools for analyzing MLNs. In the literature, several community detection algorithms for MLNs have been proposed. Moreover, there are several options for the graph representation of an MLN: for example, directed or undirected, weighted or unweighted, and using information from all or only some layers. Although these options may affect the results of community detection in MLNs, representations that are effective for community detection have not yet been clarified. In this paper, we experimentally evaluate the effectiveness of three types of community detection algorithms for MLNs and examine how the graph representation of an MLN affects the results of these algorithms. Our main findings are as follows: (1) The flattening approach is particularly effective, whereas the layer-by-layer approach is not applicable to detecting communities in MLNs of Twitter users. (2) Using a directed graph for each layer of an MLN increases the accuracy of community detection. (3) The Leiden method, which is a community detection algorithm for single-layer networks, achieves comparable accuracy with the community detection algorithms for MLNs, which suggests that there exists room for improvement in multilayer community detection algorithms for effectively utilizing the multilayer structures of MLNs.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Mersenne Twister (MT) (MT19937), developed 30 years ago, is the de facto pseudorandom number generator (PRNG) used in many computer programs. This paper proposes a candidate that offers a randomness quality that is better than MT19937 and its sisters SFMT19937 and TinyMT. A special three-neighborhood, two-state cellular automaton (CA), called CA (150′) is the underlying model of this PRNG. The same working style of MT19937 is used, while avoiding the problems of the MT, like a large state space and the zero-access initial state problem. Nonlinearity is added in the base simple linear CA such that the properties of the base CA are not violated. Finally, a PRNG is developed using this CA that beats MT19937 as well as its advanced versions over the standard empirical platforms Dieharder, TestU01 and NIST.
{"title":"Cellular Automaton-Based Emulation of the Mersenne Twiste","authors":"Kamalika Bhattacharjee, Nitin More, Shobhit Kumar Singh, Nikhil Verma","doi":"10.25088/complexsystems.32.2.139","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.139","url":null,"abstract":"The Mersenne Twister (MT) (MT19937), developed 30 years ago, is the de facto pseudorandom number generator (PRNG) used in many computer programs. This paper proposes a candidate that offers a randomness quality that is better than MT19937 and its sisters SFMT19937 and TinyMT. A special three-neighborhood, two-state cellular automaton (CA), called CA (150′) is the underlying model of this PRNG. The same working style of MT19937 is used, while avoiding the problems of the MT, like a large state space and the zero-access initial state problem. Nonlinearity is added in the base simple linear CA such that the properties of the base CA are not violated. Finally, a PRNG is developed using this CA that beats MT19937 as well as its advanced versions over the standard empirical platforms Dieharder, TestU01 and NIST.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-15DOI: 10.25088/complexsystems.32.2.115
Sreeya Ghosh, Sudhakar Sahoo, Sk. Sarif Hassan, Jayanta Kumar Das, Pabitra Pal Choudhury, Antara Sengupta
The cellular automaton (CA) and an integral value transformation (IVT) evolving in discrete time steps are two mathematical models that are well established. Theoretically, it can be suggested that a CA possesses the capacity to produce varieties of evolutionary patterns. However, computing a CA in higher dimensions or computing a nonlinear CA may be complex. In such cases, an IVT can be conveniently used. This paper presents the relation between the transition functions of a one-dimensional CA and an IVT. It also highlights the algebraic structures on the basis of binary operations for a set of transition functions of a one-dimensional CA and for a set of IVTs. The suitability of using an IVT over a CA is discussed. Also, we present the evolutionary models of two deoxyribonucleic acid (DNA) sequences through IVTs and their spacetime diagrams. This can eventually bring out some characteristic features of the evolutionary sequences.
{"title":"One-Dimensional Cellular Automaton Transitions and Integral Value Transformations Representing Deoxyribonucleic Acid Sequence Evolutions","authors":"Sreeya Ghosh, Sudhakar Sahoo, Sk. Sarif Hassan, Jayanta Kumar Das, Pabitra Pal Choudhury, Antara Sengupta","doi":"10.25088/complexsystems.32.2.115","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.115","url":null,"abstract":"The cellular automaton (CA) and an integral value transformation (IVT) evolving in discrete time steps are two mathematical models that are well established. Theoretically, it can be suggested that a CA possesses the capacity to produce varieties of evolutionary patterns. However, computing a CA in higher dimensions or computing a nonlinear CA may be complex. In such cases, an IVT can be conveniently used. This paper presents the relation between the transition functions of a one-dimensional CA and an IVT. It also highlights the algebraic structures on the basis of binary operations for a set of transition functions of a one-dimensional CA and for a set of IVTs. The suitability of using an IVT over a CA is discussed. Also, we present the evolutionary models of two deoxyribonucleic acid (DNA) sequences through IVTs and their spacetime diagrams. This can eventually bring out some characteristic features of the evolutionary sequences.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：