ro·bot

(rō′bŏt′)

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.

Mentioned in

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

Neutrosophic General Finite Automata

The committee report told the story, "Atkins' Automaton machine, entered by Mr.

THE LARGELY FORGOTTEN ROLE OF Jearum Atkins IN REAPER DEVELOPMENT

Let r denote the number of actions that learning automaton can take.

A Learning Automata-based Algorithm for Area Coverage Problem in Directional Sensor Networks

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.

Automata

The FU operation can be described by an "improved" automaton model.

Simulation Modeling Environment For Complex Data Driven Distributed Systems Design

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.

Automata in SageMath--Combinatorics meets theoretical computer science

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.

Academic insight: Professor Alan Purvis, chair of electronic engineering in the School of Engineering and Computing Sciences, Durham University

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.

Classical automata on promise problems

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.

Efficient solutions for the complement of [ww.sup.R] and the complement of ww

reconfigured so that it is transformed to a linear (or nonlinear) automaton i.e.

CONCEPT OF PSEUDO-RING SELF-TEST OF THE RAM

robot

ro·bot