๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Amalgams of inverse semigroups and reversible two-counter machines

โœ Scribed by Rodaro, Emanuele; Silva, Pedro V.

Book ID
119305679
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
428 KB
Volume
217
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Universality of a reversible two-counter
Universality of a reversible two-counter machine
โœ Kenichi Morita ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 884 KB

A k-counter machine (CM(k)) is an automaton having k counters as an auxiliary memory. It has been shown by Minsky that a CM(2) can simulate any Turing machine and thus it is universal. In this paper, we investigate the computing ability of reversible (i.e., backward deterministic) CMs. We first sho