Finite H-systems with 3 test tubes are not predictable

Finite H-systems with n test tubes are splicing systems of n test tubes over a common molecular alphabet, sigma, with a filter Fi [symbol: see text] sigma for each test tube. Initially, arbitrary many copies of molecules and enzymes (splicing rules) from a finite set of molecules and enzymes are giv...

Full description

Saved in:

Bibliographic Details
Published in:	Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing p. 547
Main Authors:	Priese, L, Rogojine, Y, Margenstern, M
Format:	Journal Article
Language:	English
Published:	United States 1998
Subjects:	Algorithms Computer Simulation Computing Methodologies Drug Design Programming Languages Reproducibility of Results
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Finite H-systems with n test tubes are splicing systems of n test tubes over a common molecular alphabet, sigma, with a filter Fi [symbol: see text] sigma for each test tube. Initially, arbitrary many copies of molecules and enzymes (splicing rules) from a finite set of molecules and enzymes are given to the test tubes that produce new molecules by splicing and filtering. It is known that any formal language can be generated by a finite H-system with 9 test tubes and that the results of finite H-systems with 6 test tubes are unpredictable. Here we present a rather simple proof that the results of finite H-systems with only 3 test tubes are unpredictable and that 4 test tubes suffices to generate any formal language.
ISSN:	2335-6936