robot

(redirected from automaton)
Also found in: Dictionary, Thesaurus, Financial, Encyclopedia, Wikipedia.
Related to automaton: Cellular automaton, Pushdown automaton

ro·bot

(rō′bŏt′)
n.
1. A mechanical device that sometimes resembles a human and is capable of performing a variety of often complex human tasks on command or by being programmed in advance.
2. A machine or device that operates automatically or by remote control.
3. A person who works mechanically without original thought, especially one who responds automatically to the commands of others.
References in periodicals archive ?
[11] A general fuzzy automaton (GFA) is an eight-tuple machine F = (Q, [summation], R, Z, [delta], [omega], [F.sub.1], [F.sub.2]) where
The committee report told the story, "Atkins' Automaton machine, entered by Mr.
Let r denote the number of actions that learning automaton can take.
Continuing this tradition, the house of Van Cleef & Arpels has harnessed all of its designers' talents to create an exceptional automaton: a fairy, whose movements celebrate the art of the inventors of past centuries.
It consists in the construction of a minimal finite automaton (FA) which can traverse the border of any cluster on any 2D binary grid and always stops in the planar site percolation model.
The FU operation can be described by an "improved" automaton model.
Figure 1 shows an example of an automaton. Obviously, an automaton has little to do with a vending machine which returns a snack after inserting a coin.
Human Programming: Brainwashing, Automatons, and American Unfreedom
Based on algorithms called cellular automaton, these are able to mimic the specialised stem cells that can repair any tissue in the human body.
A one-way nondeterministicfinite automaton with [epsilon]-moves ([1.sub.[epsilon]]NFA, for short) is a quintuple A = (S, [SIGMA], H, [s.sub.I], [S.sub.A]), where S is a finite set of states, [SIGMA] an input alphabet, [s.sub.I] G S an initial state, and [S.sub.A] [??] S a set of accepting (final) states.
In chapter II we show that the complement of the language [ww.sup.R] is context free by designing a non deterministic finite pushdown automaton that accepts it.
reconfigured so that it is transformed to a linear (or nonlinear) automaton i.e.