{"title":"二维可逆分区元胞自动机的时间反转对称性及其应用","authors":"K. Morita","doi":"10.1080/17445760.2022.2102169","DOIUrl":null,"url":null,"abstract":"Time-reversal symmetry (T-symmetry) in a reversible cellular automaton (CA) is the property in which forward and backward evolutions of configurations are governed by the same local transition function. We show that the framework of partitioned cellular automata (PCAs) is useful to study T-symmetries of reversible CAs. Here, we investigate reversible elementary square PCAs (ESPCAs) and reversible elementary triangular PCAs (ETPCAs), and prove that a large number of reversible ESPCAs and all reversible ETPCAs are T-symmetric under some kinds of simple transformations on configurations. As applications, these results are used to find and analyse backward evolution processes in reversible PCAs. For example, for a given functional module implemented in a reversible PCA, such as a reversible logic element, we can obtain its inverse functional module very easily using its T-symmetry.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Time-reversal symmetries in two-dimensional reversible partitioned cellular automata and their applications\",\"authors\":\"K. Morita\",\"doi\":\"10.1080/17445760.2022.2102169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time-reversal symmetry (T-symmetry) in a reversible cellular automaton (CA) is the property in which forward and backward evolutions of configurations are governed by the same local transition function. We show that the framework of partitioned cellular automata (PCAs) is useful to study T-symmetries of reversible CAs. Here, we investigate reversible elementary square PCAs (ESPCAs) and reversible elementary triangular PCAs (ETPCAs), and prove that a large number of reversible ESPCAs and all reversible ETPCAs are T-symmetric under some kinds of simple transformations on configurations. As applications, these results are used to find and analyse backward evolution processes in reversible PCAs. For example, for a given functional module implemented in a reversible PCA, such as a reversible logic element, we can obtain its inverse functional module very easily using its T-symmetry.\",\"PeriodicalId\":45411,\"journal\":{\"name\":\"International Journal of Parallel Emergent and Distributed Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Parallel Emergent and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/17445760.2022.2102169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Parallel Emergent and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17445760.2022.2102169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Time-reversal symmetries in two-dimensional reversible partitioned cellular automata and their applications
Time-reversal symmetry (T-symmetry) in a reversible cellular automaton (CA) is the property in which forward and backward evolutions of configurations are governed by the same local transition function. We show that the framework of partitioned cellular automata (PCAs) is useful to study T-symmetries of reversible CAs. Here, we investigate reversible elementary square PCAs (ESPCAs) and reversible elementary triangular PCAs (ETPCAs), and prove that a large number of reversible ESPCAs and all reversible ETPCAs are T-symmetric under some kinds of simple transformations on configurations. As applications, these results are used to find and analyse backward evolution processes in reversible PCAs. For example, for a given functional module implemented in a reversible PCA, such as a reversible logic element, we can obtain its inverse functional module very easily using its T-symmetry.