In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a 6-state semi-totalistic CA capable of simulating any boolean circuit and any Turing machine on this aperiodic tiling.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We study the Firing Squad Synchronization Problem (FSSP) on a cellular automaton (CA) having number-conservation property. In a number-conserving CA, all states of cells are represented by (tuples of) non-negative integers and the total number of its configuration is conserved throughout its computing processes. But, if we use a usual framework of CA in which each state of a cell is represented by a single integer, it is not possible to make every cell to be in the same firing state, which should be different from the soldier state, under the usual FSSP condition without violating the number-conservativeness. So, we employ the framework of a partitioned cellular automaton, and define a number-conserving partitioned cellular automaton (NC-PCA). Its cell is divided into three parts, and hence each cell is represented by a triple of non-negative integers. In NC-PCA, only the constraint that the local transition function should satisfy a number-conserving condition is supposed. Thus, it makes relatively easy to construct an NC-PCA. Because each cell can hold three non-negative integers, it is possible to represent different states even if the sum of three numbers are equal. Using this technique, we show that Minsky's 3n time solution can be embedded into an NC-PCA, having an integer at most 9 in each part of a cell.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We present simulation and separation results between multi-dimensional deterministic and alternating cellular automata (CAs). It is shown that for any integers k ł l ł 1, every k-dimensional t(n)-time deterministic CA can be simulated by an l-dimensional O(t(n)[(k-l+1)/( k-l+2)])-time alternating CA. This result is a dimension reduction theorem and also a time reduction theorem: (i) Every multi-dimensional deterministic CA can be simulated by a one-dimensional alternating CA without increasing time complexity. (ii) Every deterministic computation in a multi-dimensional deterministic CA can be sped up quadratically by alternations when the dimension is fixed. Furthermore, it is shown that there is a language which can be accepted by a one-dimensional alternating CA in t(n) time but not by any multi-dimensional deterministic CA in t(n) time.
A series of highly luminescent pyrazolo[3,4-b]quinolines were prepared and used as luminophores in fabrication of three-layer electroluminescent devices. The devices were fabricated using the basic structure of indium tinoxide (ITO)/TPD/Pyrazoloquinoline/ ALQ/Mg:Ag, where TPD (3-methylphenyl)-1,1_-biphenyl-4,4_-diamine was used as a hole transport layer and AlQ (8-hydroxyquinoline) as an electron transport layer. Bright blue-green and blue emissions were obtained from all the devices with such configurations. The devices with 6d and 6f pyrazoloquinoline derivatives achieved Lmax = 20800 cd/m2 and 8550 cd/m2 at a current density of 30 mA/4 mm2. The luminance efficiency was 3.38 and 1.70 lm/W respectively.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.