HAL (Le Centre pour la Communication Scientifique Directe), Jul 25, 2016
In P systems working in the set derivation mode, even in the maximally parallel derivation mode, ... more In P systems working in the set derivation mode, even in the maximally parallel derivation mode, rules are only applied in at most one copy in each derivation step. We also consider the set mode in the cases of taking those sets of rules with the maximal number of applicable rules or with affecting the maximal number of objects. For many variants of P systems, the computational completeness proofs even literally still hold true for these new set derivation modes. On the other hand, we obtain new results for P systems using target selection for the rules to be chosen together with these set derivation modes.
The focus of this paper is the family of languages generated by transitional non-cooperative P sy... more The focus of this paper is the family of languages generated by transitional non-cooperative P systems without further ingredients. This family can also be defined by so-called time yields of derivation trees of context-free grammars. In this paper we prove that such languages can be parsed in polynomial time, where the degree of polynomial may depend on the number of rules and on the size of the alphabet. 1
HAL (Le Centre pour la Communication Scientifique Directe), Aug 1, 2022
The systems using insertion and deletion systems are used in several areas of theoretical compute... more The systems using insertion and deletion systems are used in several areas of theoretical computer science, ranging from linguistics to DNA computing. In this paper we investigate insertion and deletion systems within the regulated rewriting framework. We consider various regulation mechanisms already studied in the area of insertiondeletion systems and recall several results, but also elaborate some new results and also consider new control mechanisms.
We introduce several variants of input-driven tissue P automata – we also will call them chocolat... more We introduce several variants of input-driven tissue P automata – we also will call them chocolate automata – where the rules to be applied only depend on the input symbol. Both strings and multisets are considered as input objects; the strings are either read from an input tape or defined by the sequence of symbols taken in, and the multisets are given in an input cell at the beginning of a computation, enclosed in a vesicle. Additional symbols generated during a computation are stored in this vesicle, too. An input is accepted when the vesicle reaches a final cell and it is empty. The computational power of some variants of input-driven tissue P automata (chocolate automata) is illustrated by examples and compared with the power of the input-driven variants of other automata as register machines and counter automata.
HAL (Le Centre pour la Communication Scientifique Directe), Aug 5, 2019
The concept of a matter object being annihilated when meeting its corresponding anti-matter objec... more The concept of a matter object being annihilated when meeting its corresponding anti-matter object is taken over for membranes as objects and anti-membranes as the corresponding annihilation counterpart in P systems. Natural numbers can be represented by the corresponding number of membranes with a specific label. Computational completeness in this setting then can be obtained with using only elementary membrane division rules, without using objects. A similar result can be obtained for tissue P systems with cell division rules and cell / anti-cell annihilation rules. In both cases, as derivation modes we may take the standard maximally parallel derivation modes as well as any of the maximally parallel set derivation modes (non-extendable (multi)sets of rules, (multi)sets with maximal number of rules, (multi)sets of rules affecting the maximal number of objects).
and small universal systems, P systems as parallel distributed multiset and string processing, Pr... more and small universal systems, P systems as parallel distributed multiset and string processing, Promoters/inhibitors and priorities, Active membranes and polarizations, Symport and antiport, Determinism and reversibility, Insertiondeletion-substitution and [hybrid] networks of evolutionary processors, Maximal and minimal parallelism and asynchronous mode. Structure of the thesis: 1 The thesis is written in English and consists of Introduction, 6 chapters, general conclusions and recommendations, bibliography of 291 titles, 8 appendices and 219 pages of main text. The thesis includes certain numbered material: 25 figures, 9 tables, 22 definitions, 19 lemmas, 77 theorems, 47 corollaries, 9 remarks, 24 examples and 54 formulas. Publications on the thesis topic: 120, see the author's publication webpage 2 for the list of scientific papers and links.
We consider d-dimensional contextual array grammars and investigate their computational power whe... more We consider d-dimensional contextual array grammars and investigate their computational power when using various control mechanisms-matrices, regular control languages, and tissue P systems, which work like regular control languages, but may end up with a final check for the non-applicability of some rules. For d ≥ 2, d-dimensional contextual array grammars are less powerful than matrix contextual array grammars, which themselves are less powerful than contextual array grammars with regular control languages. The use of tissue P systems with their final non-applicability check even yields some additional computational power. In the 1-dimensional case, the family of 1-dimensional array languages generated by contextual array grammars with regular control languages can be characterized as the family of array images of the linear languages, which for a one-letter alphabet means that it coincides with the family of regular 1-dimensional array languages.
P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a nove... more P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We define three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides.
Catalytic P systems are among the rst variants of membrane systems ever considered in this area. ... more Catalytic P systems are among the rst variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particularly the problem of using only one catalyst: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be su cient for obtaining even computational completeness with only one catalyst. In this paper we show that one catalyst is su cient for obtaining even computational completeness if catalytic rules have weak priority over the non-catalytic rules
Q-value를 포함할 경우에는 예측 각막구면수차=0.389×Q-value+(0.022×Axial power 3 mm)-0.633 (R 2 =0.436)였으며, Q-value... more Q-value를 포함할 경우에는 예측 각막구면수차=0.389×Q-value+(0.022×Axial power 3 mm)-0.633 (R 2 =0.436)였으며, Q-value를 포함하지 않을 경우 예측 각막 구면수차=0.184×(Mean power 5 mm-Mean power 3 mm)+(0.02×Axial power 3 mm)-0.563 (R 2 =0.429)였다. 유도된 공식을 활용하여 오차 범위 0.1 μm 내에서 약 93.4-94.7%를 예측할 수 있었다.
In this paper we consider prescribed sets of rules working on several objects either in parallel-... more In this paper we consider prescribed sets of rules working on several objects either in parallel-in this case the rules have to take different objects-or else sequentially in any order-in this case several rules may take the same object to work on. We show that prescribed teams of size two, i.e., containing exactly two rules, are sufficient to obtain computational completeness for strings with the simple rules being of the form aIR(b)-meaning that a symbol b can be inserted on the right-hand side of a string ending with a-and DR(b) meaning that a symbol b is erased on the right-hand side of a string. This result is established for systems starting with three initial strings. Using prescribed teams of size three, we may start with only two strings, ending up with the output string and the second string having been reduced to the empty string. We also establish similar results when using the generation of the anti-object b − on the right-hand side of a string instead of deleting the object b, i.e. bIR(b −) inserts the anti-object b − and the annihilation rule b b − assumed to happen immediately whenever b and b − meet deletes the b.
For P systems with active membranes, it is known that computational completeness can be obtained ... more For P systems with active membranes, it is known that computational completeness can be obtained with either of the following combinations of features: 1)two polarizations, 2)membrane creation and dissolution, 3)four membranes with three labels, membrane division and dissolution, 4)seven membranes with two labels, membrane division and dissolution. Clearly, with one membrane only object evolution rules and send-out rules are permitted. Two variants are considered: external output and internal output.
Membrane computing is a formal framework of distributed parallel computing. In this paper we intr... more Membrane computing is a formal framework of distributed parallel computing. In this paper we introduce a variant of the multiset rewriting model where the rules of every region are defined by the contents of interior regions, rather than being explicitly specified in the description of the system. This idea is inspired by the von Neumann’s concept of “program is data”
HAL (Le Centre pour la Communication Scientifique Directe), Jul 25, 2016
In P systems working in the set derivation mode, even in the maximally parallel derivation mode, ... more In P systems working in the set derivation mode, even in the maximally parallel derivation mode, rules are only applied in at most one copy in each derivation step. We also consider the set mode in the cases of taking those sets of rules with the maximal number of applicable rules or with affecting the maximal number of objects. For many variants of P systems, the computational completeness proofs even literally still hold true for these new set derivation modes. On the other hand, we obtain new results for P systems using target selection for the rules to be chosen together with these set derivation modes.
The focus of this paper is the family of languages generated by transitional non-cooperative P sy... more The focus of this paper is the family of languages generated by transitional non-cooperative P systems without further ingredients. This family can also be defined by so-called time yields of derivation trees of context-free grammars. In this paper we prove that such languages can be parsed in polynomial time, where the degree of polynomial may depend on the number of rules and on the size of the alphabet. 1
HAL (Le Centre pour la Communication Scientifique Directe), Aug 1, 2022
The systems using insertion and deletion systems are used in several areas of theoretical compute... more The systems using insertion and deletion systems are used in several areas of theoretical computer science, ranging from linguistics to DNA computing. In this paper we investigate insertion and deletion systems within the regulated rewriting framework. We consider various regulation mechanisms already studied in the area of insertiondeletion systems and recall several results, but also elaborate some new results and also consider new control mechanisms.
We introduce several variants of input-driven tissue P automata – we also will call them chocolat... more We introduce several variants of input-driven tissue P automata – we also will call them chocolate automata – where the rules to be applied only depend on the input symbol. Both strings and multisets are considered as input objects; the strings are either read from an input tape or defined by the sequence of symbols taken in, and the multisets are given in an input cell at the beginning of a computation, enclosed in a vesicle. Additional symbols generated during a computation are stored in this vesicle, too. An input is accepted when the vesicle reaches a final cell and it is empty. The computational power of some variants of input-driven tissue P automata (chocolate automata) is illustrated by examples and compared with the power of the input-driven variants of other automata as register machines and counter automata.
HAL (Le Centre pour la Communication Scientifique Directe), Aug 5, 2019
The concept of a matter object being annihilated when meeting its corresponding anti-matter objec... more The concept of a matter object being annihilated when meeting its corresponding anti-matter object is taken over for membranes as objects and anti-membranes as the corresponding annihilation counterpart in P systems. Natural numbers can be represented by the corresponding number of membranes with a specific label. Computational completeness in this setting then can be obtained with using only elementary membrane division rules, without using objects. A similar result can be obtained for tissue P systems with cell division rules and cell / anti-cell annihilation rules. In both cases, as derivation modes we may take the standard maximally parallel derivation modes as well as any of the maximally parallel set derivation modes (non-extendable (multi)sets of rules, (multi)sets with maximal number of rules, (multi)sets of rules affecting the maximal number of objects).
and small universal systems, P systems as parallel distributed multiset and string processing, Pr... more and small universal systems, P systems as parallel distributed multiset and string processing, Promoters/inhibitors and priorities, Active membranes and polarizations, Symport and antiport, Determinism and reversibility, Insertiondeletion-substitution and [hybrid] networks of evolutionary processors, Maximal and minimal parallelism and asynchronous mode. Structure of the thesis: 1 The thesis is written in English and consists of Introduction, 6 chapters, general conclusions and recommendations, bibliography of 291 titles, 8 appendices and 219 pages of main text. The thesis includes certain numbered material: 25 figures, 9 tables, 22 definitions, 19 lemmas, 77 theorems, 47 corollaries, 9 remarks, 24 examples and 54 formulas. Publications on the thesis topic: 120, see the author's publication webpage 2 for the list of scientific papers and links.
We consider d-dimensional contextual array grammars and investigate their computational power whe... more We consider d-dimensional contextual array grammars and investigate their computational power when using various control mechanisms-matrices, regular control languages, and tissue P systems, which work like regular control languages, but may end up with a final check for the non-applicability of some rules. For d ≥ 2, d-dimensional contextual array grammars are less powerful than matrix contextual array grammars, which themselves are less powerful than contextual array grammars with regular control languages. The use of tissue P systems with their final non-applicability check even yields some additional computational power. In the 1-dimensional case, the family of 1-dimensional array languages generated by contextual array grammars with regular control languages can be characterized as the family of array images of the linear languages, which for a one-letter alphabet means that it coincides with the family of regular 1-dimensional array languages.
P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a nove... more P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We define three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides.
Catalytic P systems are among the rst variants of membrane systems ever considered in this area. ... more Catalytic P systems are among the rst variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particularly the problem of using only one catalyst: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be su cient for obtaining even computational completeness with only one catalyst. In this paper we show that one catalyst is su cient for obtaining even computational completeness if catalytic rules have weak priority over the non-catalytic rules
Q-value를 포함할 경우에는 예측 각막구면수차=0.389×Q-value+(0.022×Axial power 3 mm)-0.633 (R 2 =0.436)였으며, Q-value... more Q-value를 포함할 경우에는 예측 각막구면수차=0.389×Q-value+(0.022×Axial power 3 mm)-0.633 (R 2 =0.436)였으며, Q-value를 포함하지 않을 경우 예측 각막 구면수차=0.184×(Mean power 5 mm-Mean power 3 mm)+(0.02×Axial power 3 mm)-0.563 (R 2 =0.429)였다. 유도된 공식을 활용하여 오차 범위 0.1 μm 내에서 약 93.4-94.7%를 예측할 수 있었다.
In this paper we consider prescribed sets of rules working on several objects either in parallel-... more In this paper we consider prescribed sets of rules working on several objects either in parallel-in this case the rules have to take different objects-or else sequentially in any order-in this case several rules may take the same object to work on. We show that prescribed teams of size two, i.e., containing exactly two rules, are sufficient to obtain computational completeness for strings with the simple rules being of the form aIR(b)-meaning that a symbol b can be inserted on the right-hand side of a string ending with a-and DR(b) meaning that a symbol b is erased on the right-hand side of a string. This result is established for systems starting with three initial strings. Using prescribed teams of size three, we may start with only two strings, ending up with the output string and the second string having been reduced to the empty string. We also establish similar results when using the generation of the anti-object b − on the right-hand side of a string instead of deleting the object b, i.e. bIR(b −) inserts the anti-object b − and the annihilation rule b b − assumed to happen immediately whenever b and b − meet deletes the b.
For P systems with active membranes, it is known that computational completeness can be obtained ... more For P systems with active membranes, it is known that computational completeness can be obtained with either of the following combinations of features: 1)two polarizations, 2)membrane creation and dissolution, 3)four membranes with three labels, membrane division and dissolution, 4)seven membranes with two labels, membrane division and dissolution. Clearly, with one membrane only object evolution rules and send-out rules are permitted. Two variants are considered: external output and internal output.
Membrane computing is a formal framework of distributed parallel computing. In this paper we intr... more Membrane computing is a formal framework of distributed parallel computing. In this paper we introduce a variant of the multiset rewriting model where the rules of every region are defined by the contents of interior regions, rather than being explicitly specified in the description of the system. This idea is inspired by the von Neumann’s concept of “program is data”
Uploads
Papers by Artiom Alhazov