Random good picture Not show

(31) First the cellular automata model based on the concrete carbonation mechanism is presented.

(32) Timed automata is in the application of real-time system and model checking.

(33) With the development of science and technology , the automata theory has got deep development and extensive application , become the important foundation of theory and application for many subjects.

(34) The structure of feedforward inverse finite automata is a fundamental problem in the invertibility theory of finite automata.

(35) Using DCM as a data structure for the reachability analysis algorithm for multirate automata, the complexity can considerably be decreased.

(36) A curve approximation method based on Cellular Automata was produced, and was applied to digital approximation of hydraulic turbine performance data.

(37) It is very important to investigate the decomposition of weakly invertible finite automata, since it could provide an approach to cryptanalyzing finite automata public-key cryptosystem(FAPKC).

(38) Model checking is a formal verification by exhaustive search to finite state automata.

(39) Developed from Lattice Gas Cellular Automata (LGCA), Lattice-Boltzmann method is a special discrete scheme of Boltzmann equation.

(40) The first step constructs an NFA ( Nondeterministic Finite Automaton) equivalent to the regular expression, where the operation for constructing finite automata withe -moves is omitted.

(41) Absrtact: The problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.

(42) The highway toll collector system was researched by using the finite automata theory.

(43) Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata.

(44) According to the property that all states of a certain cellular automata can build a permutation group, we can design block cipher based on this property.

(45) Petri Net, Finite State Automata ( FSA ) , IDEF 3 and State Charts are traditionally used for behavior modeling.

(46) In the initial design stage, the Neimoidians were to resemble the conical-snouted gangly battle droids that they employ, an indication that the war automata was designed in their image.

(47) And the other method uses the cellular automata theory to construct GeoCA-LandUse model to describe the change on the real time.

(48) Proposed an one-dimensional sandpile model which include avalanche probability,[http://sentencedict.com/automata.html] and performed computer simulation by cellular automata method.

(49) Based on the cellular automata theory, a new method of designing irregular weave by computer is introduced.

(50) The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automata theory.

(51) The systems are usually described by the timed automata and the properties are specified by the temporal logic.

(52) Intuitionistic fuzzy finite automata theory is an important part of automata theory.

(53) This paper discusses workflow models and their formal descriptions using parallel finite automata PFA theory.

(54) John von Neumann and Stanislaw Ulam in the 1940s were among the first to consider attempting to understand natural phenomena via cellular automata and computers.

(55) The stochastic automata model is obtained by adding sensor information and the occurrence probability of event to the logical model.

(56) A formal modeling method based on Timed Automata Network is proposed for real-time concurrent system. The case study of ATP (Automatic Train P...

(57) Investigates the implementation scheme of cellular automata(CA) for application in the pseudo-random test of very large scale integration(VLSI) as a test pattern generator.

(58) This paper deals with the critical point of three - dimensional bootstrap percolation - like cellular automata.

(59) This paper provides a test framework based on finite automata to test the OO specification.

(60) Scanner automata, design of algorithm translation to generate TOKEN, keyword, industry at table, symbol table, constant table.