Mathematical Theory of L Systems
Mathematical Theory of L Systems
On the state complexity of reversals of regular languages
Theoretical Computer Science
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Functions and sequences generated by reaction systems
Theoretical Computer Science
Transactions on Computational Systems Biology XIV
Minimal and almost minimal reaction systems
Natural Computing: an international journal
| Hi-index | 0.00 |
The paper investigates sequences generated by reaction systems . Arbitrary sequences can be generated if the cardinalities of the sets of reactants and inhibitors are unbounded. Most of the paper investigates systems where both of these cardinalities equal 1. A general result is obtained concerning sequences generated by systems with interaction . New estimates are obtained for lengths of sequences in the non-interactive case.