Determinism in Multi-Soliton Automata
<|reference_start|>Determinism in Multi-Soliton Automata: Soliton automata are mathematical models of soliton switching in chemical molecules. Several concepts of determinism for soliton automata have been defined. The concept of strong determinism has been investigated for the case in which only a single soliton can be present in a molecule. In the present paper, several different concepts of determinism are explored for the multi-soliton case. It is shown that the degree of non-determinism is a connected measure of descriptional complexity for multi-soliton automata. A characterization of the class of strongly deterministic multi-soliton automata is presented. Finally, the concept of perfect determinism, forming a natural extension of strong determinism, is introduced and considered for multi-soliton automata.<|reference_end|>
@article{bordihn2024determinism,
    title={Determinism in Multi-Soliton Automata},
    author={Henning Bordihn (University of Potsdam, Institute of Computer
  Science), Helena Schulz},
    journal={EPTCS 407, 2024, pp. 44-58},
    year={2024},
    doi={10.4204/EPTCS.407.4},
    archivePrefix={arXiv},
    eprint={2409.06969},
    primaryClass={cs.FL}
}