Scholarlink

We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way bijections both implicitly, concerning their computational complexity, and with zero-garbage.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Towards a Characterization of Two-Way Bijections in a Reversible Computational Model

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • 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 with zero-garbage.