Results 1 
5 of
5
New Computing Paradigms Suggested by DNA Computing: Computing by Carving
 4th Int. Meeting on DNABased Computing
, 1998
"... Inspired by the experiments in the emerging area of DNA computing, a somewhat unusual type of a computation strategy was recently proposed by one of us: generate a (large) set of candidate solutions of a problem, then remove the nonsolutions such that what remains is the set of solutions. This has ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Inspired by the experiments in the emerging area of DNA computing, a somewhat unusual type of a computation strategy was recently proposed by one of us: generate a (large) set of candidate solutions of a problem, then remove the nonsolutions such that what remains is the set of solutions. This has been called a computation by carving. This idea leads both to a speculation with possible important consequences and to interesting theoretical computer science (formal language) questions. The speculation is that in this way we can "compute" nonrecursively enumerable languages, because the family of recursively enumerable languages is not closed under complementation. The formal language theory questions concern sequences of languages with certain regularities, needed as languages to be extracted from the total language of candidate solutions of a problem. Specifically, we consider sequences of languages obtained by starting from a given regular language and iteratively applying to it a...
Iterated LengthPreserving Rational Transductions
 IN PROC. 23RD SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (MFCS'98
, 1998
"... The purpose of this paper is the study of the smallest family of transductions containing lengthpreserving rational transductions and closed under union, composition and iteration. We give several characterizations of this class using restricted classes of lengthpreserving rational transductions, ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
The purpose of this paper is the study of the smallest family of transductions containing lengthpreserving rational transductions and closed under union, composition and iteration. We give several characterizations of this class using restricted classes of lengthpreserving rational transductions, by showing the connections with "contextsensitive transductions" and transductions associated with recognizable picture languages. We also study the classes obtained by only using lengthpreserving rational functions and we show the relations with "deterministic contextsensitive transductions".
Bidirectional Cooperating Distributed Grammar Systems
, 1996
"... We consider bidirectional cooperating distributed (BCD) grammar systems in the sense of Asveld. Independently of their mode , , =, , or t, BCD grammar systems with two components characterize the recursively enumerable languages even with rightlinear rules and without productions. This sharply c ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider bidirectional cooperating distributed (BCD) grammar systems in the sense of Asveld. Independently of their mode , , =, , or t, BCD grammar systems with two components characterize the recursively enumerable languages even with rightlinear rules and without productions. This sharply contrasts earlier results on solely generating or accepting grammars, where rightlinear rules always only lead to regular languages. Further restrictions lead to language families closely related to Lindenmayer language families. Moreover, we can solve some open problems in the theory of bidirectional grammars in this way. 1 Introduction Formal language theory mainly investigates the descriptional power of various language defining devices. In this paper, bidirectional cooperating distributed grammar systems are considered. In this way, the present work continues and brings together at least five different research directions in formal language theory: Cooperating distributed (CD) grammar ...
Closure Under Union And Composition Of Iterated Rational Transductions
, 1999
"... We proceed our work on iterated transductions by studying the closure under union and composition of some classes of iterated functions. We analyze this closure for the classes of lengthpreserving rational functions, lengthpreserving subsequential functions and lengthpreserving sequential func ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We proceed our work on iterated transductions by studying the closure under union and composition of some classes of iterated functions. We analyze this closure for the classes of lengthpreserving rational functions, lengthpreserving subsequential functions and lengthpreserving sequential functions with terminal states. All the classes we obtain are equal. We also study the connection with deterministic contextsensitive languages.
Iteration of rational transductions
, 1998
"... The purpose of this paper is to show connections between iterated lengthpreserving rational transductions and linear space computations. Hence, we study the smallest family of transductions containing lengthpreserving rational transductions and closed under union, composition and iteration. We give ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The purpose of this paper is to show connections between iterated lengthpreserving rational transductions and linear space computations. Hence, we study the smallest family of transductions containing lengthpreserving rational transductions and closed under union, composition and iteration. We giveseveral characterizations of this class using restricted classes of lengthpreserving rational transductions, by showing the connections with "contextsensitive transductions" and transductions associated with recognizable picture languages.