A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads (Q3453732)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads |
scientific article |
Statements
A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads (English)
0 references
30 November 2015
0 references
multi-head finite automaton
0 references
reversible computing
0 references
reversible Turing machine
0 references
garbage-less computation
0 references
