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