Book ChapterDOI
On the rule complexity of universal tissue p systems
Yurii Rogozhin,Sergey Verlan +1 more
- Vol. 3850, pp 356-362
TLDR
It is shown that 8 rules suffice to recognise any recursively enumerable language if splicing tissue P systems are considered, and that this language cannot be described in terms of membranes or objects.Abstract:
In the last time several attempts to decrease different complexity parameters (number of membranes, size of rules, number of objects etc.) of universal P systems were done. In this article we consider another parameter which was not investigated yet: the number of rules. We show that 8 rules suffice to recognise any recursively enumerable language if splicing tissue P systems are considered.read more
Citations
More filters
Journal ArticleDOI
Small universal spiking neural P systems.
TL;DR: In this paper, the authors considered the case of spiking neural P systems (SNP systems), in two variants: as devices that compute functions and as generators of sets of numbers, and they found a universal system with restricted rules having 76 neurons and one with extended rules having 50 neurons.
Book ChapterDOI
A formal framework for static (tissue) P systems
Rudolf Freund,Sergey Verlan +1 more
TL;DR: A formal general framework for static membrane systems that aims to capture most of the essential features of (tissue) P systems and to define their functioning in a formal way is introduced.
Journal ArticleDOI
Computational power of tissue P systems for generating control languages
TL;DR: It is proved that tissue P systems with antiport rules of weight one and without symport rules characterize regular languages and that the rule complexity is crucial for tissues P systems to achieve a desired computational power.
Journal ArticleDOI
The complexity of small universal Turing machines: A survey
Damien Woods,Turlough Neary +1 more
TL;DR: In this paper, it was shown that the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient simulators of Turing machines.
Journal Article
Smaller Universal Spiking Neural P Systems
TL;DR: This paper improves in the number of neurons used in the study of small universal spiking neural P systems, which use 67 neurons for standard rules and 41 neurons for extended rules in the case of computing functions.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
Computing with Membranes
TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.
Book
Introduction To Automata Theory, Languages And Computation, 3Rd Edition
TL;DR: The introduction to formal languages and automata wasolutionary rather than rcvolrrtionary and addressed Initially, I felt that giving solutions to exercises was undesirable hecause it lirrritcd the Chapter 1 fntroduction to the Theory of Computation.
Book
DNA Computing: New Computing Paradigms
TL;DR: This book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory, and brings the reader to the most advanced theories develop thus far in this emerging research area.