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 the normal view instead:
scientific article; zbMATH DE number 6514779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads |
scientific article; zbMATH DE number 6514779 |
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
0.8583112359046936
0 references
0.8497560620307922
0 references
0.8428692817687988
0 references
0.8105335235595703
0 references
0.7670888900756836
0 references
