Deterministic Soliton Automata with at Most One Cycle

@article{Dassow1993DeterministicSA,
  title={Deterministic Soliton Automata with at Most One Cycle},
  author={J{\"u}rgen Dassow and Helmut J{\"u}rgensen},
  journal={J. Comput. Syst. Sci.},
  year={1993},
  volume={46},
  pages={155-197}
}
Soliton valves have been proposed as molecular switching elements. Their mathematical model is the soliton graph and the soliton automaton (Dassow and Jiirgensen, J. Comput. System Sci. 40 (1990) 154181). In this paper we continue the study of the logic aspects of soliton switching. There are two cases of special importance: those of deterministic and those of strongly deterministic soliton automata. The former have deterministic state transitions in the usual sense of automaton theory. The… CONTINUE READING
3 Citations
5 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Solitons & Polarons in Conducting Polymers,

  • Lull Y. Lu
  • World Scientific, Singapore,
  • 1988

Davydov

  • A. S
  • “Solitons in Molecular Systems,” Reidel…
  • 1985
1 Excerpt

The molecular device computer: Point of departure for large scale cellular automata

  • F. L. CARTER
  • Physica D
  • 1984

CARTER (Ed.), “Molecular Electronic Devices,

  • F L.
  • 1982

WIELANDT, “Finite Permutation Groups,

  • H. Will
  • 1964

Similar Papers

Loading similar papers…