AbstractWe 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
This paper introduces a special class of cellular automata, called triangle cellular automata, which...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
Consider a family of boolean circuitsC1,C2,...,Cn,..., constructed by some uniform, effective proced...
AbstractWe present a relationship between two major models of parallel computation: the one-way cell...
International audienceWe present a relationship between two major models of parallel computation: th...
AbstractThe notion of one-dimensional one-way cellular automata has been introduced to model cellula...
This paper studies a restriction of one-dimensional bounded cellular automata in which information i...
The intended goal of this manuscript is to build bridges between two definitions of complexity. One ...
AbstractThe Boolean circuit has been an important model of parallel computation, but not many parall...
This thesis began with a question about how the human brain works and then two type of Boolean Netwo...
AbstractWe compare the two computational models of Boolean circuits and arithmetic circuits in cases...
AbstractThe effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on...
Descriptive complexity provides intrinsic, that is,machine-independent, characterizations of the maj...
[[abstract]]© 1995 Institute of Electrical and Electronics Engineers - We present a unilateral 2D ce...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...
This paper introduces a special class of cellular automata, called triangle cellular automata, which...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
Consider a family of boolean circuitsC1,C2,...,Cn,..., constructed by some uniform, effective proced...
AbstractWe present a relationship between two major models of parallel computation: the one-way cell...
International audienceWe present a relationship between two major models of parallel computation: th...
AbstractThe notion of one-dimensional one-way cellular automata has been introduced to model cellula...
This paper studies a restriction of one-dimensional bounded cellular automata in which information i...
The intended goal of this manuscript is to build bridges between two definitions of complexity. One ...
AbstractThe Boolean circuit has been an important model of parallel computation, but not many parall...
This thesis began with a question about how the human brain works and then two type of Boolean Netwo...
AbstractWe compare the two computational models of Boolean circuits and arithmetic circuits in cases...
AbstractThe effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on...
Descriptive complexity provides intrinsic, that is,machine-independent, characterizations of the maj...
[[abstract]]© 1995 Institute of Electrical and Electronics Engineers - We present a unilateral 2D ce...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...
This paper introduces a special class of cellular automata, called triangle cellular automata, which...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
Consider a family of boolean circuitsC1,C2,...,Cn,..., constructed by some uniform, effective proced...
DOI
Add to ORKG