Paper Info
Title
Forbidding-enforcing systems
Abstract
This paper presents a model of molecular computing that is based on two kinds of "boundary conditions": forbidding and enforcing. Forbidding conditions require that a contradictory (or conflicting) group of components (molecules) may not be present in a (molecular) system, as otherwise the system will "die". An enforcing condition requires that if a certain group of components (molecules) is present in a system, then eventually other components will be present in the system -- hence such an enforcing condition models a molecular reaction. Thus the evolution of a system is determined by the enforcing conditions, but it is constraint by the forbidding conditions. Such forbidding-enforcing systems (fe systems) are investigated in this paper in the framework of strings--i.e., molecules are represented by strings. Each fe system defines a family of languages (rather than just one language, which is standard in formal language theory)--each language in this family presents a set of molecules that satisfy both forbidding and enforcing constraints. In this paper we investigate basic computational properties of fe systems operating on strings.
Year
DOI
Venue
2003
10.1016/S0304-3975(01)00088-3
Theor. Comput. Sci.
Keywords
DocType
Volume
Forbidding-enforcing system,Theory of computation,boundary condition,condition model,Molecular computing,Formal language theory,fe system,forbidding-enforcing system,molecular reaction,basic computational property,formal language theory,certain group,molecular computing
Journal
292
Issue
ISSN
Citations 
3
Theoretical Computer Science
12
PageRank 
References 
Authors
2.75
0
2
Name
Order
Citations
PageRank
A. Ehrenfeucht11823497.83
G. Rozenberg29313.01