International audienceWe present a relationship between two major models of parallel computation: the one-way cellular automata and the boolean circuits. The starting point is the boolean circuit of small depth designed by Ladner and Fischer to simulate any rational transducer. We extend this construction to simulate one-way cellular automata by boolean circuits
Cellular automata are investigated towards their ability to compute transductions, that is, to trans...
AbstractWe compare the two computational models of Boolean circuits and arithmetic circuits in cases...
We compare two computational models that appeared in the literature in a Boolean setting and in an a...
International audienceWe present a relationship between two major models of parallel computation: th...
AbstractWe present a relationship between two major models of parallel computation: the one-way cell...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
This thesis began with a question about how the human brain works and then two type of Boolean Netwo...
[[abstract]]© 1995 Institute of Electrical and Electronics Engineers - We present a unilateral 2D ce...
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleav...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...
Descriptive complexity provides intrinsic, that is,machine-independent, characterizations of the maj...
Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A...
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleav...
This note is a survey of examples and results about cellular automata with the purpose of recalling ...
We compare two computational models that appeared in the literature in a Boolean setting and in an a...
Cellular automata are investigated towards their ability to compute transductions, that is, to trans...
AbstractWe compare the two computational models of Boolean circuits and arithmetic circuits in cases...
We compare two computational models that appeared in the literature in a Boolean setting and in an a...
International audienceWe present a relationship between two major models of parallel computation: th...
AbstractWe present a relationship between two major models of parallel computation: the one-way cell...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
This thesis began with a question about how the human brain works and then two type of Boolean Netwo...
[[abstract]]© 1995 Institute of Electrical and Electronics Engineers - We present a unilateral 2D ce...
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleav...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...
Descriptive complexity provides intrinsic, that is,machine-independent, characterizations of the maj...
Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A...
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleav...
This note is a survey of examples and results about cellular automata with the purpose of recalling ...
We compare two computational models that appeared in the literature in a Boolean setting and in an a...
Cellular automata are investigated towards their ability to compute transductions, that is, to trans...
AbstractWe compare the two computational models of Boolean circuits and arithmetic circuits in cases...
We compare two computational models that appeared in the literature in a Boolean setting and in an a...
DOI
Add to ORKG