Chocolate P Automata

Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu; Oswald, Marion; Verlan, Sergey

doi:10.1007/978-3-030-00265-7_1

Cited by 2 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition 2 Let T(∈ S # ) be a multiset and (∈ A # ) be a multiset of reactions over A, where A is a set of reactions in S. Then, we say that (1) is enabled by…”

Section: Definitionmentioning

confidence: 99%

“…that the class of languages accepted by P automata is not beyond the class of context-sensitive languages, while P automata can characterize the class of recursively enumerable languages if terminal symbols are introduced and any other symbol is ignored [64]. Lately, several variants of input-driven tissue P automata (called chocolate automata) were investigated, in which both strings and multisets are considered for inputs, and the input symbol thoroughly controls the transition of computing processes [1]. Thus, RAs are closely related to a modified variant of P automata in which rules of replacing multisets (enhanced with inhibitor functioning) are used at each computation step, and neither membrane structure nor a mapping component is required.…”

Section: Membrane Computing Modelsmentioning

confidence: 99%

See 1 more Smart Citation

Theory of reaction automata: a survey

Yokomori

Okubo

2021

J Membr Comput

View full text Add to dashboard Cite

In this paper, we survey on reaction automata theory to model and analyze the biochemical behaviors of vital reactions occurring in nature. Inspired by two notions of a reaction system initiated by Ehrenfeucht and Rozenberg in 2007 and of a multiset, reaction automata (RAs) have been proposed as computing models for accepting string languages. Given an input sequence of symbols, an RA performs its computation process as follows: at every time of receiving an input symbol, it changes the current configuration (represented by a multiset) by applying reaction rules to the multiset in a prescribed manner, for which two kinds of application manners are considered: the maximally parallel manner and the (usual) sequential manner. An RA functions as an extended finite automaton in which multisets play a role of (unbounded number of) states and the state transition is performed by applying reaction rules. We show that the computational powers of RAs are Turing universal in both manners of rule applications. The relationship between the space-bounded variants of RA and the Chomsky hierarchy is also discussed. Further, we discuss the notion of chemical reaction automata, which is a simplified variant of RAs with reaction rules that are free from inhibitor functioning. We complete this survey with a variety of related models of computing together with future research topics.

show abstract

“…Definition 2 Let T(∈ S # ) be a multiset and (∈ A # ) be a multiset of reactions over A, where A is a set of reactions in S. Then, we say that (1) is enabled by…”

Section: Definitionmentioning

confidence: 99%

Section: Membrane Computing Modelsmentioning

confidence: 99%

Theory of reaction automata: a survey

Yokomori

Okubo

2021

J Membr Comput

View full text Add to dashboard Cite

show abstract

“…Many variants of SN P systems have been proposed, such as asynchronous SN P systems [3], sequential SN P systems [8], SN P systems with anti-spikes [16], homogenous SN P systems [47], SN P systems with astrocytes [19], SN P systems with weighted synapses [21], SN P systems with rules on synapses [32], SN P systems with weights [36], SN P systems with a generalized use of rules [52], SN P systems with white hole neurons [27], SN P systems with request rules [30], cell-like SN P systems [43], extended SN P systems [1], SN P systems with scheduled synapses [2], SN P systems with polarizations [19]. Most of the classes of SN P systems obtained are computationally universal, equivalent in power to Turing machines [4,11,15,31,33,35,40,42,46,51,53].…”

Section: Introductionmentioning

confidence: 99%

Implementation of Arithmetic Operations by SN P Systems with Communication on Request

Jiang

Kong

Zhu

2018

INT J COMPUT COMMUN

View full text Add to dashboard Cite

Spiking neural P systems (SN P systems, for short) are a class of distributed and parallel computing devices inspired from the way neurons communicate by means of spikes. In most of the SN P systems investigated so far, the system communicates on command, and the application of evolution rules depends on the contents of a neuron. However, inspired from the parallel-cooperating grammar systems, it is natural to consider the opposite strategy: the system communicates on request, which means spikes are requested from neighboring neurons, depending on the contents of the neuron. Therefore, SN P systems with communication on request were proposed, where the spikes should be moved from a neuron to another one when the receiving neuron requests that. In this paper, we consider implementing arithmetical operations by means of SN P systems with communication on request. Specifically, adder, subtracter and multiplier are constructed by using SN P systems with communication on request.

show abstract

Chocolate P Automata

Cited by 2 publications

References 27 publications

Theory of reaction automata: a survey

Theory of reaction automata: a survey

Implementation of Arithmetic Operations by SN P Systems with Communication on Request

Contact Info

Product

Resources

About