0
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      On the complexity of occurrence and convergence problems in reaction systems

      , ,
      Natural Computing
      Springer Nature America, Inc

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references6

          • Record: found
          • Abstract: not found
          • Article: not found

          Introducing time in reaction systems

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Events and modules in reaction systems

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              On the Computational Complexity of Finite Cellular Automata

              K. Sutner (1995)
                Bookmark

                Author and article information

                Journal
                Natural Computing
                Nat Comput
                Springer Nature America, Inc
                1567-7818
                1572-9796
                March 2015
                August 22 2014
                March 2015
                : 14
                : 1
                : 185-191
                Article
                10.1007/s11047-014-9456-3
                32160436-ff1a-4f35-8bf6-041b797e4751
                © 2015
                History

                Comments

                Comment on this article