Some aspects of logical reversibility for computing devices with a finite number of discrete
internal states are addressed. These devices have a read-only input tape, may be equipped …

A two-way multi-head finite automaton (MFA) is a variant of a finite automaton consisting of a
finite-state control, a finite number of heads that can move in two directions, and a read-only …

Graph-walking automata (GWA) are finite-state devices that traverse graphs given as an
input by following their edges; they have been studied both as a theoretical notion and as a …

We study reversible deterministic finite automata (REV-DFAs), that are partial deterministic
finite automata whose transition function induces an injective map** on the state set for …

One-way multi-head finite automata are considered towards their ability to perform
reversible computations. It is shown that, for every number k≥ 1 of heads, there are …

We study reversible deterministic finite automata (REV-DFAs), that are partial deterministic
finite automata whose transition function induces an injective map** on the state set for …

The paper proposes a general notation for deterministic automata traversing finite
undirected structures: the graph-walking automata. This abstract notion covers such models …

Finite-state devices with a read-only input tape that may be equipped with further resources
as queues or pushdown stores are considered towards their ability to perform reversible …

Reversible computation is an unconventional form of computing that extends the standard
forward-only mode of computation with the ability to execute a sequence of operations in …

This PhD dissertation investigates garbage-free reversible computing systems from abstract
design to physical gate-level implementation. Designed in reversible logic, we propose a …