scientific article; zbMATH DE number 7444005
From MaRDI portal
Publication:5016363
zbMath1483.68170arXiv1705.10533MaRDI QIDQ5016363
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1705.10533
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata ⋮ Concise Representations of Reversible Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Waiting for Landauer
- Eaters of the lotus: Landauer's principle and the return of Maxwell's demon
- The connection between logical and thermodynamic irreversibility
- EXORCIST XIV: the wrath of Maxwell's demon. II: From Szilard to Landauer and beyond
- Maxwell's demon and the thermodynamics of computation
- Notes on Landauer's principle, reversible computation, and Maxwell's demon
- Reversible space equals deterministic space
- Concise representations of reversible automata
- Minimal and Reduced Reversible Automata
- Aspects of Reversibility for Classical Automata
- Reversible and Irreversible Computations of Deterministic Finite-State Devices
- Information erasure without an energy cost
- Minimal Reversible Deterministic Finite Automata
- Irreversibility and Heat Generation in the Computing Process
- Inference of Reversible Languages
- Logical Reversibility of Computation
This page was built for publication:
