Continuous automaton

About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.

Events which are not representable by a probabilistic automaton

Abstract: (finite) state set w and n are the initial and final vectors respectIvely over the states and (A(o)} are the transltlon matrices corresixmd-ing to the letters o ~. If x = Ol...o k~ E* then A(x) is the matrix A(x) = A(el)... A(a k) and pA(x) is the wc~-function with domain ~* and real values in the interval [0,i]: pA(x) = IA{x),. Let X be a real 0 <_ • I, n ati or sta s the uage (set of words or eye.t) T(A,A)-{x;x e Z', pA(x) > A}. Sunh a lance will be called probab~llstlo. Problem: Is there art language L which is not probabilistlc? Bukha~ev (1965) has given an example of such a lan~m~e over a single letter alphabet. Unforturately, he did not prove his example (which is quite ccmpllcated, belng defined on the basis of four arbitrary primitive recursive functions). We have not been able to prove Bukharaev's result, nor have we succeeded in establishing contact with him (directly or indirectly) and, to the best of our knowledge nobody else in the West kr~ws how to prove that result (see e.g. Salcmea (1968) who needed that result in order to establish scme relation between time variant events and prob-abilistlc evemts). Note that, when looking for a language as above, one must take into cor~ideration that there may be different automata defining-8

A Construction Method of Moore Neighborhood Number-Conserving Cellular Automata

Abstract: A number-conserving cellular automaton (NCCA) is a cellular automaton such that all states of cells are represented by integers and the total of the numbers (states) of all cells of a global configuration is conserved throughout its computing process. It can be thought to be a kind of modelization of the physical conservation law of mass or energy. In this paper, we show a sufficient condition for a Moore neighborhood CA to be number-conserving. According to this condition, the local function of rotation-symmetric NCCA is expressed by a summation of quaternary functions. On this framework, we construct a 6-state logically universal NCCA.

Apparatus and method for estimation of spatial structure of protein by cellular automaton

Abstract: PROBLEM TO BE SOLVED: To provide a computerized technique for a spatial structure analysis of protein that helps efficient drug discovery by shortening a time span bottlenecking existing techniques while ensuring practical accuracy. SOLUTION: A proposed model based on a cellular automaton method is a discrete three-dimensional model with layered hexagonal lattice planes, and unit cells have information on a contained amino acid and its accompanying charge and mass. The transition of the unit cells depends on a vector sum from the surrounding cells. The mobility of the unit cells also varies with temperature. The framework represents the structure of protein. COPYRIGHT: (C)2005,JPO&NCIPI

Generalized reversibility of cellular automata with boundaries

Abstract: In this paper, cellular automata with boundaries are addressed by using the theories of semi-tensor product and Drazin inverse of matrices. For a cellular automaton with boundaries, a dynamical system model is constructed, then a necessary and sufficient condition for the reversibility is given, and a concept of generalized inverse cellular automaton that characterizes the local energy conservation is presented. Besides, a representation for the (generalized) inverse cellular automaton together with a unified algorithm to calculate it is given. Some examples are given to illustrate the algorithm.