Reversible parallel communicating finite automata systems
From MaRDI portal
Publication:2041681
DOI10.1007/s00236-021-00396-9OpenAlexW3186239756MaRDI QIDQ2041681
Henning Bordihn, György Vaszil
Publication date: 23 July 2021
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-021-00396-9
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversible simulation of one-dimensional irreversible cellular automata
- Reversible nondeterministic finite automata
- Reversible pushdown automata
- One-way reversible multi-head finite automata
- Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities
- Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
- UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA
- ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA
- Aspects of Reversibility for Classical Automata
- When input-driven pushdown automata meet reversiblity
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
- Two-Way Reversible Multi-Head Finite Automata
- Irreversibility and Heat Generation in the Computing Process
- On Communicating Finite-State Machines
- Returning and non-returning parallel communicating finite automata are equivalent
- On Multi-Head Finite Automata
- Logical Reversibility of Computation
This page was built for publication: Reversible parallel communicating finite automata systems