Forbidding and enforcing in membrane computing

作者: Matteo Cavaliere , Nataša Jonoska

DOI: 10.1023/A:1025492906773

关键词: Complex systemTheory of computationConstant (computer programming)Theoretical computer scienceDNA computingMembrane computingExponential spaceComputer science

摘要: Motivated by biochemistry and the non-deterministic reactions between molecules, authors in (Ehrenfeucht Rozenberg, 2003) introduced concept of forbidding-enforcing systems (fe-systems) that define families languages. Using same we propose to study forbidding enforcing within membrane systems. Two approaches are presented; first case system generates languages second a single language. We show using membranes, cannot be defined any fe-system can generated. When language is generated, SAT solved constant time (at price an exponential space). Also example context-free generated without forbidders.

参考文章(3)
A. Ehrenfeucht, G. Rozenberg, Forbidding-enforcing systems Theoretical Computer Science. ,vol. 292, pp. 611- 638 ,(2003) , 10.1016/S0304-3975(01)00088-3
Gheorghe Păun, Grzegorz Rozenberg, A guide to membrane computing Theoretical Computer Science. ,vol. 287, pp. 73- 100 ,(2002) , 10.1016/S0304-3975(02)00136-6