APA (7th ed.) Citation

Barile, A., Berardi, S., & Roversi, L. (2025). Termination of rewriting on reversible Boolean circuits as a free 3-category problem. Theoretical Computer Science, 1028, N.PAG. https://doi.org/10.1016/j.tcs.2024.115031

Chicago Style (17th ed.) Citation

Barile, Adriano, Stefano Berardi, and Luca Roversi. "Termination of Rewriting on Reversible Boolean Circuits as a Free 3-category Problem." Theoretical Computer Science 1028 (2025): N.PAG. https://doi.org/10.1016/j.tcs.2024.115031.

MLA (9th ed.) Citation

Barile, Adriano, et al. "Termination of Rewriting on Reversible Boolean Circuits as a Free 3-category Problem." Theoretical Computer Science, vol. 1028, 2025, p. N.PAG, https://doi.org/10.1016/j.tcs.2024.115031.