Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Journal of Computer and System Sciences
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Computation: finite and infinite machines
Computation: finite and infinite machines
Universality Results for Some Variants of P Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Systems with Activated/Prohibited Membrane Channels
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Simulating Counter Automata by P Systems with Symport/Antiport
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Systems without Priorities Are Computationally Universal
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computing with Membranes (P Systems): Universality Results
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
A Survey of Some Variants of P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On The Power of Tissue P Systems Working in the Minimal Mode
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
On the Computational Power of Enhanced Mobile Membranes
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The Expressiveness of Concentration Controlled P Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Turing Completeness Using Three Mobile Membranes
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
P systems with active membranes: trading time for space
Natural Computing: an international journal
A general framework for regulated rewriting based on the applicability of rules
Computation, cooperation, and life
Computability power of mobility in enhanced mobile membranes
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Symbol/Membrane complexity of p systems with symport/antiport rules
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Quantum sequential p systems with unit rules and energy assigned to membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Implementation of catalytic p systems
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On the computability power of membrane systems with controlled mobility
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Membrane Systems with Coupled Transport: Universality and Normal Forms
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
GP Systems with Forbidding Context
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
| Hi-index | 0.00 |
We improve the results elaborated in [6] on the number of non-terminal symbols needed in matrix grammars, programmed grammars, and graph-controlled grammars with appearance checking for generating arbitrary recursively enumerable languages. Of special interest is the result that the number of non-terminal symbols used in the appearance checking mode can be restricted to two. In the case of graph controlled (and programmed grammars) with appearance checking also the number of non-terminal symbols can be reduced to three (and four, respectively); in the case of matrix grammars with appearance checking we either need four non-terminal symbols with three of them being used in the appearance checking mode or else again we only need two nonterminal symbols being used in the appearance checking mode, but in that case we cannot bound the total number of non-terminal symbols.