| 词汇 | automaton |
| 释义 | automaton noun[ C ] uk /ɔːˈtɒm.ə.tən/ us /ɑːˈtɑː.mə.t̬ən/pluralautomatons or automatauk /ɔːˈtɒm.ə.tə/ us /ɑːˈtɑː.mə.t̬ə/ a machine that operates on its own without the need for human control, or a person who acts like a machine, without thinking or feeling: 自动操作装置，机器人;机械行事的人 I take the same route to work every day, like some sort of automaton.我每天按同一路线去上班，就像个机器人一样。 Machines - general words 3-D printer animatronic automated automation backhoe chuck coffee machine convenience crankshaft Heath Robinson humanoid immobilizer roller snow thrower stacker stump grinder supersensitivity synchrotron valve workhorse Examples of automatonautomaton If this is fixed then the automaton is a fixed structure deterministic or a fixed structure stochastic automaton. The idea is simply to construct an automaton like that pictured above for a specified behaviour. The macro for automata enables a programmer to ignore this distinction, while still leaving both implementations a possibility. Their method of dictionary storage (a minimal acyclic deterministic finite automaton) enables them to apply the substitutions and to check the results very rapidly. This enables client programmers to choose the algorithm and the type of automata they wish to use. It can be exactly the same as with deterministic finite automata if all possible percepts can be collected. The resulting graphs may be employed in various ways, for example as neural networks, as automata, or as knowledge-base queries. The dictionary can then be represented by an automaton in which final states are provided with numbers referring to these codes. In the operational approach, the semantics of a program is specified using the transition function of a suitable abstract machine (automaton). The operational semantics is given in terms of probabilistic automata. We give the language an operational semantics in terms of a simplified version of probabilistic automata. Extended patterns such as (2) are stripped of actions and compiled into automata whose union yields level recognizers, just as before. One natural implementation of this language of automata is to create a vector or other random-access data structure to represent the states. Our construction can be modified by adding final states to recover the classical minimal realisation theory for finite automata. One or more states are start states, unless the automaton is empty. These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
| 随便看 |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。