Small asynchronous P systems with inhibitors defining non-semilinear sets
Article in Theoretical Computer Science (November 2017)
The most recent citing publication is shown below. View this citation on Dimensions.
Automata, Universality, Computation
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 The Common Structure of the Curves Having a Same Gauss Word
-
Altmetric BadgeChapter 2 Logical Theory of the Additive Monoid of Subsets of Natural Integers
-
Altmetric BadgeChapter 3 Some Reflections on Mathematics and Its Relation to Computer Science
-
Altmetric BadgeChapter 4 Sampling a Two-Way Finite Automaton
-
Altmetric BadgeChapter 5 Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines
-
Altmetric BadgeChapter 6 Constructing Reversible Turing Machines by Reversible Logic Element with Memory
-
Altmetric BadgeChapter 7 The Grossone Methodology Perspective on Turing Machines
-
Altmetric BadgeChapter 8 On Parallel Array P Systems
-
Altmetric BadgeChapter 9 Small P Systems Defining Non-semilinear Sets
-
Altmetric BadgeChapter 10 Generalized Communicating P Automata
-
Altmetric BadgeChapter 11 Computational Models Based on Splicing
-
Altmetric BadgeChapter 12 Linear Cellular Automata and Decidability
-
Altmetric BadgeChapter 13 Algorithms with Active Cells Modeled by Cellular Automata with Write-Access (CA-w)
-
Altmetric BadgeChapter 14 Broadcasting Automata and Patterns on ℤ 2
-
Altmetric BadgeChapter 15 Real-Time Prime Generators Implemented on Small-State Cellular Automata
-
Altmetric BadgeChapter 16 Phyllosilicate Automata
-
Altmetric BadgeChapter 17 DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology