Cite
Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over [formula omitted].
MLA
Du, Xinyu, et al. “Efficient Methods with Polynomial Complexity to Determine the Reversibility of General 1D Linear Cellular Automata over [Formula Omitted].” Information Sciences, vol. 594, May 2022, pp. 163–76. EBSCOhost, https://doi.org/10.1016/j.ins.2022.01.045.
APA
Du, X., Wang, C., Wang, T., & Gao, Z. (2022). Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over [formula omitted]. Information Sciences, 594, 163–176. https://doi.org/10.1016/j.ins.2022.01.045
Chicago
Du, Xinyu, Chao Wang, Tianze Wang, and Zeyu Gao. 2022. “Efficient Methods with Polynomial Complexity to Determine the Reversibility of General 1D Linear Cellular Automata over [Formula Omitted].” Information Sciences 594 (May): 163–76. doi:10.1016/j.ins.2022.01.045.