Aspects of Reversibility for Classical Automata

DOI10.1007/978-3-319-13350-8_7zbMath1323.68342OpenAlexW124851435MaRDI QIDQ2944881

Martin Kutrib

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (20)

Reversible top-down syntax analysis ⋮ Boosting Reversible Pushdown Machines by Preprocessing ⋮ The Degree of Irreversibility in Deterministic Finite Automata ⋮ Energy complexity of regular language recognition ⋮ Reversible Limited Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata ⋮ Queue Automata: Foundations and Developments ⋮ Reversible Top-Down Syntax Analysis ⋮ Energy complexity of regular languages ⋮ Reversible Two-Party Computations ⋮ Minimal Reversible Deterministic Finite Automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Unnamed Item ⋮ Concise Representations of Reversible Automata ⋮ Reversible parallel communicating finite automata systems ⋮ An instruction set for reversible Turing machines ⋮ Minimal and Reduced Reversible Automata ⋮ The Degree of Irreversibility in Deterministic Finite Automata ⋮ Boosting Reversible Pushdown and Queue Machines by Preprocessing

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On time-symmetry in cellular automata
• Reversible simulation of one-dimensional irreversible cellular automata
• Real-time reversible iterative arrays
• Reversible computing and cellular automata -- a survey
• Fast reversible language recognition using cellular automata
• Time-reversal symmetry in dynamical systems: a survey
• On locally reversible languages
• Learning approximately regular languages with reversible languages
• Reversible space equals deterministic space
• Reversible pushdown automata
• Determination of finite automata accepting subregular languages
• A Lower Bound For Reversible Automata
• Time-Symmetric Machines
• Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
• A Simple and Efficient Universal Reversible Turing Machine
• Two-Way Reversible Multi-Head Finite Automata
• Degrees of Reversibility for DFA and DPDA
• One-Way Reversible Multi-head Finite Automata
• Irreversibility and Heat Generation in the Computing Process
• Inference of Reversible Languages
• Reversible Queue Automata
• Developments in Language Theory
• Real-Time Reversible One-Way Cellular Automata
• Deterministic context free languages
• Lower Bound of the Number of Threshold Functions
• The Theory of Definite Automata
• Two Families of Languages Related to ALGOL
• Logical Reversibility of Computation

This page was built for publication: Aspects of Reversibility for Classical Automata