Reversible and irreversible computations of deterministic finite-state devices
From MaRDI portal
Recommendations
Cites work
- A hierarchy of fast reversible Turing machines
- A lower bound for reversible automata
- A simple and efficient universal reversible Turing machine
- Aspects of reversibility for classical automata
- Bayesian inference of predictor's relative importance in multiple regression
- Degrees of reversibility for DFA and DPDA
- Developments in Language Theory
- Fast reversible language recognition using cellular automata
- scientific article; zbMATH DE number 3961009 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 2086620 (Why is no real title available?)
- Inference of Reversible Languages
- Irreversibility and Heat Generation in the Computing Process
- Learning approximately regular languages with reversible languages
- Logical Reversibility of Computation
- Minimal reversible deterministic finite automata
- On the efficient construction of quasi-reversible automata for reversible languages
- One-way reversible multi-head finite automata
- QRT FIFO automata, breadth-first grammars and their relations
- Real-time reversible iterative arrays
- Real-time reversible one-way cellular automata
- Reversibility and surjectivity problems of cellular automata
- Reversible computing and cellular automata -- a survey
- Reversible limited automata
- Reversible multi-head finite automata characterize reversible logarithmic space
- Reversible pushdown automata
- Reversible queue automata
- Reversible simulation of one-dimensional irreversible cellular automata
- Reversible space equals deterministic space
- The Power of the Queue
- Time/Space Trade-Offs for Reversible Computation
- Two-way reversible multi-head finite automata
- Über einen Automaten mit Pufferspeicherung
Cited in
(20)- A unification of probabilistic choice within a design-based model of reversible computation
- Minimal and Reduced Reversible Automata
- Reversibility of computations in graph-walking automata
- Aspects of reversibility for classical automata
- Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
- scientific article; zbMATH DE number 6691416 (Why is no real title available?)
- On asymptotic gate complexity and depth of reversible circuits without additional memory
- Abstract Storage Devices
- Irreversibility and dissipation in finite-state automata
- Reversible queue automata
- Reversible languages having finitely many reduced automata
- scientific article; zbMATH DE number 7444007 (Why is no real title available?)
- Concise representations of reversible automata
- Finite automata with undirected state graphs
- Transducing reversibly with finite state machines
- Transducing reversibly with finite state machines
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
- Weakly and Strongly Irreversible Regular Languages
- Reversible Top-Down Syntax Analysis
- Reversible top-down syntax analysis
This page was built for publication: Reversible and irreversible computations of deterministic finite-state devices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946323)
