Tree operations in P systems and λ-calculus

Authors:
Nataša Jonoska;Maurice Margenstern
Affiliations:
Department of Mathematics, University of South-Florida, 4202 E. Fowler Ave., PHY 114, Tampa, FL;LITA, EA 3097, Université de Metz, Île du Saulcy, 57045 Metz Cédex, France
Venue:
Fundamenta Informaticae
Year:
2003

Citing 7
Cited 1

Lambda-calculus, types and models

Lambda-calculus, types and models
Tree languages

Handbook of formal languages, vol. 3
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction

Membrane Computing: An Introduction
A guide to membrane computing

Theoretical Computer Science - Natural computing
Forbidding and enforcing in membrane computing

Natural Computing: an international journal
Tissue-like P Systems with Active Membranes for Picture Generation

Fundamenta Informaticae

λP systems and typed λ-calculus

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a membrane system (named λP systems) in which the computation is performed through certain operations on the tree structure of the membranes. The objects within the membranes play the role of catalysts for the operations. The result of the computation is the final configuration of the system. We show that λP systems can simulate pure λ-calculus and so they have universal computational power. We also show that NP-complete problems can be solved in polynomial time in this way by showing that 3SAT is solvable in linear time with linear input.