Showing cs.LOShow all
2 papers · 1 filter
cs.LO2025
Towards a Characterization of Two-way Bijections in a Reversible Computational Model
Matteo Palazzo, Luca Roversi
We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way Bijections both implicitly, concerning their computational complexity, and wi…
cs.LO2024
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem
Adriano Barile, Stefano Berardi, Luca Roversi
Reversible Boolean Circuits are an interesting computational model under many aspects and in different fields, ranging from Reversible Computing to Quantum Computing. Our contribut…