Search Sciweavers | Sciweavers

21

LATIN
1995
Springer

117views Information Technology» more LATIN 1995»

Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata

13 years 9 months ago

Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...

Jérôme Olivier Durand-Lose

claim paper

Read More »

19

click to vote

TCS
2008

125views Theoretical Computer Science» more TCS 2008»

Reversible computing and cellular automata - A survey

13 years 5 months ago

Download ir.lib.hiroshima-u.ac.jp

Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. ...

Kenichi Morita

claim paper

Read More »

8

click to vote

COCOON
2006
Springer

92views Combinatorics» more COCOON 2006»

Varieties Generated by Certain Models of Reversible Finite Automata

13 years 9 months ago

Download cjtcs.cs.uchicago.edu

Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...

Marats Golovkins, Jean-Eric Pin

claim paper

Read More »

15

click to vote

IPL
2008

79views more IPL 2008»

On the efficient construction of quasi-reversible automata for reversible languages

13 years 5 months ago

Download users.dsic.upv.es

Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...

Pedro García, Manuel Vazquez de Parga, Dami...

claim paper

Read More »

17

click to vote

DMCCG
2001
Springer

118views Combinatorics» more DMCCG 2001»

Representing Reversible Cellular Automata with Reversible Block Cellular Automata

13 years 10 months ago