On State Sequences Defined by Reaction Systems

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.

[1]  Andrzej Ehrenfeucht,et al.  A Tour of reaction Systems , 2011, Int. J. Found. Comput. Sci..

[2]  Andrzej Ehrenfeucht,et al.  Reaction Systems , 2007, Fundam. Informaticae.

[3]  Arto Salomaa,et al.  Mirror Images and Schemes for the Maximal Complexity of Nondeterminism , 2012, Fundam. Informaticae.

[4]  J. Busch,et al.  On the Optimality of the Binary Algorithm for the Jacobi Symbol , 2007, Fundam. Informaticae.

[5]  Michael Domaratzki,et al.  Deletion along trajectories , 2004, Theor. Comput. Sci..

[6]  Andrzej Ehrenfeucht,et al.  Functions Defined by Reaction Systems , 2011, Int. J. Found. Comput. Sci..

[7]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[8]  Derick Wood,et al.  On the state complexity of reversals of regular languages , 2004, Theor. Comput. Sci..