(1) I do the same route to work every day, like some sort of automaton.

(2) The automaton no longer looked so innocent.

(3) Surrounded by enslaved automatons, he was a free man.

(4) It was the mechanical accuracy of an automaton.

(5) I was what the materialists declared a human to be, an automaton.

(6) This does not mean you should behave like an automaton.

(7) Rising slowly like an automaton, she made her way over to the counter and picked up the receiver.

(8) Servants were not allowed to have eyes that were alive, that spoke of a person and not an automaton.

(9) Piper wagged his hand up and down like a broken automaton.

(10) He created several automatons, the most celebrated being Psycho, which first performed in 1875.

(11) They're born to be automatons, consumed by baubles and gimmicks.

(12) She was an automaton, carrying out the simple instructions of her neural program: If whit fly occupied, withhold sperm.

(13) Moving like an automaton, she went through all the motions of washing, dressing and putting on make-up.

(14) He took my hand and led me away from the automaton.

(15) As though I did not exist; as though it were an automaton who cleared brambles and counted magpies.

(16) Colette had continued to type like an automaton, never raising her eyes from the page she was copying.

(17) Individuals have been pictured rather like automatons who simply respond to the dictates of their culture.

(18) I was what the materialists declared a human to be, an automaton. How strange!

(19) If he too is just an automaton driven by his genetic predispositions what can be the scientific value of his observations?

(20) Determination of finite automata China, NFA to DFA transformation.

(21) Automata theory is an important component of computer science.

(22) We extend finite automata with time sequence and define temporal finite automata, then we propose using temporal finite automat to build formal model for data fusion system.

(23) Ask a Calabrian and he will place Rome far into the industrial north, where automata follow edicts from the state.

(24) The proliferation behavior for worms is formalized by determined finite automata theory and the general process of the proliferation is abstracted.

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

(26) Cellular network computing verb ( CVCN ) theory is applied to the calculation of the verb Automata.

(27) In the second part, we study the structure of feedforward inverse finite automata in general case, and we also discuss the structure of weakly invertible finite automata.

(28) In this paper we made a survey of cellular automata(CA) traffic models which can be classified into single-lane, (multi-lane) and city traffic models.

(29) By solving the diffusion equation using the lattice gas automata (LGA), we develop a numerical technique for the modeling of flu.

(30) A more extensive and theoretical treatment of the material in 18.400 J, Automata , Computability, and Complexity computabilitytheory.

(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:///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.

(61) The three main research areas of the theory are: formal language and automata theory, computability theory and the computing complexity theory.

(62) Derrick Jensen has written extensively about "the subsumption of the individual" and the "conversion of vibrant human beings into automata."

(63) Based on the max-plus algebraic model, referring to automata theory and lattice theory, by the definitions of conjunctive and disjunctive functions, a supervisory controller was put forward.

(64) Lattice-valued finite automata. We introduce the conpect of lattice-valued finite automata. The state transition function is defined as ?

(65) For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.

(66) It makes a brief introduction on Land System TheoryDigital elevation model(DEM) theory, Cellular Automata theory[], and Markov theory referred in this paper.

(67) Unfortunately, automata theory tells us that no tool could ever statically determine which programs will throw null-pointer exceptions.

(68) Networks of timed automata with shared variables and channels are introduced as model language for concurrent real-time systems.

(69) Signal automata is a model rather fit than timed automata for a class of real-time system.

(70) Geoscientific study on cellular automata and new application of CA were summarized in the paper. Finally the authors analyzed the trend of its theoretical study and main application domain.

(71) Aiming at complex elevator group control system(EG CS ), this paper presents a new modeling method with cellular automata theory and builds an EGCS model.

(72) This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.

(73) There is a very close relation between fuzzy pushdown automata and fuzzy context-free grammars.

(74) Proposed an two - dimensional sandpile avalanche model and performed computer simulation by celluar automata method.

(75) In chapter two, the basic knowledges of finite state automata and finite homogeneous Markov chain are introduce.

(76) This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems.

(77) Because the new algorithm extends the state component of the automata, which makes constructing automata more complex, the security will be improved and it's harder to break into this cryptosystem.

(78) The subjects studied in such a course include automata theory, formal languages, and models of computation.

(78) is a sentence dictionary, on which you can find good sentences for a large number of words.

(79) Wiener reviewed the history of machine automata segueing into human anatomy.

(80) In this paper, it is mainly discussed a finite-state deterministic fuzzy automaton(FDA), which is not only equivalent to corresponding fuzzy language and is also equally powerful as other automata.

(81) Especially, as opposed to the traditional automata, the limiting behavior of the proposed algorithm possesses both absorbing barriers and ergodicity.

(82) In this paper, the definitions of fuzzy tree automata and fuzzy context-free tree grammars are extended to a more general lattice-ordered monoid.

(83) Along with the development of modern science and technology, the automata theory has already become the important foundations of theory and application for many subject.

(84) In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.

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

(86) They are very useful in protocol verifications. This paper presents some methods of protocol verification and uses KRONOS to verify FDDI to introduce the method of using timed automata.

(87) The paper models queue system using queuing theory, finite state machine principle, and cellular automata model.

(88) The concept of composition of finite automata is first proposed in finite automaton public key cryptosystem.

(89) Cellular automata is a new fast and effect theory tool for realizing image processing algorithm, whose emphasis is on how to determine its state transition function.

(90) This paper characterizes symmetric ternary cellular automata (CA -3) with the help of matrix algebra.

(91) In language theory , the simplest algorithms are those which can be implemented by finite automata, the subject of this book.

(92) That function, also known as an INHIBIT gate, turned out to be very useful for our tic-tac-toe automata.

(93) More fundamentally, maybe the mirror test, a methodological remnant of a behaviorist legacy of animals as biological automata, reflects nothing more than a human inability to understand animals.

(94) In this thesis, automata theory is used to study some complex phenomena of rail transportation system.

(95) The advent of XML initiated a symbiosis between document research and formal languages. This symbiosis resulted in the development of unranked tree automata.