| slovo | definícia |
automaton
(mass) | automaton
- automat |
automaton
(encz) | automaton,automat n: Zdeněk Brož |
Automaton
(gcide) | Automaton \Au*tom"a*ton\, n.; pl. L. Automata, E.
Automatons. [L. fr. Gr. ?, neut. of ? self-moving; ? self +
a root ma, man, to strive, think, cf. ? to strive. See
Mean, v. i.]
1. Any thing or being regarded as having the power of
spontaneous motion or action. --Huxley.
[1913 Webster]
So great and admirable an automaton as the world.
--Boyle.
[1913 Webster]
These living automata, human bodies. --Boyle.
[1913 Webster]
2. A self-moving machine, or one which has its motive power
within itself; -- applied chiefly to machines which appear
to imitate spontaneously the motions of living beings,
such as men, birds, etc.
[1913 Webster] |
automaton
(wn) | automaton
n 1: someone who acts or responds in a mechanical or apathetic
way; "only an automaton wouldn't have noticed" [syn:
automaton, zombi, zombie]
2: a mechanism that can move automatically [syn: automaton,
robot, golem] |
automaton
(foldoc) | automaton
automata
automata theory
(Plural automata) A
machine, robot, or formal system designed to follow a
precise sequence of instructions.
Automata theory, the invention and study of automata, includes
the study of the capabilities and limitations of computing
processes, the manner in which systems receive input, process
it, and produce output, and the relationships between
behavioural theories and the operation and use of automated
devices.
See also cellular automaton, finite state machine.
(1996-04-23)
|
| | podobné slovo | definícia |
Automaton
(gcide) | Automaton \Au*tom"a*ton\, n.; pl. L. Automata, E.
Automatons. [L. fr. Gr. ?, neut. of ? self-moving; ? self +
a root ma, man, to strive, think, cf. ? to strive. See
Mean, v. i.]
1. Any thing or being regarded as having the power of
spontaneous motion or action. --Huxley.
[1913 Webster]
So great and admirable an automaton as the world.
--Boyle.
[1913 Webster]
These living automata, human bodies. --Boyle.
[1913 Webster]
2. A self-moving machine, or one which has its motive power
within itself; -- applied chiefly to machines which appear
to imitate spontaneously the motions of living beings,
such as men, birds, etc.
[1913 Webster] |
Automatons
(gcide) | Automaton \Au*tom"a*ton\, n.; pl. L. Automata, E.
Automatons. [L. fr. Gr. ?, neut. of ? self-moving; ? self +
a root ma, man, to strive, think, cf. ? to strive. See
Mean, v. i.]
1. Any thing or being regarded as having the power of
spontaneous motion or action. --Huxley.
[1913 Webster]
So great and admirable an automaton as the world.
--Boyle.
[1913 Webster]
These living automata, human bodies. --Boyle.
[1913 Webster]
2. A self-moving machine, or one which has its motive power
within itself; -- applied chiefly to machines which appear
to imitate spontaneously the motions of living beings,
such as men, birds, etc.
[1913 Webster] |
automatonlike
(wn) | automatonlike
adj 1: resembling the unthinking functioning of a machine; "an
automatic `thank you'"; "machinelike efficiency" [syn:
automatic, automatonlike, machinelike, robotlike,
robotic] |
cellular automaton
(foldoc) | cellular automaton
cellular automata
(CA, plural "- automata") A regular
spatial lattice of "cells", each of which can have any one of
a finite number of states. The state of all cells in the
lattice are updated simultaneously and the state of the entire
lattice advances in discrete time steps. The state of each
cell in the lattice is updated according to a local rule which
may depend on the state of the cell and its neighbors at the
previous time step.
Each cell in a cellular automaton could be considered to be a
finite state machine which takes its neighbours' states as
input and outputs its own state.
The best known example is J.H. Conway's game of Life.
{FAQ
(http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html)}.
Usenet newsgroups: news:comp.theory.cell-automata,
news:comp.theory.self-org-sys.
(1995-03-03)
|
deterministic automaton
(foldoc) | deterministic automaton
A finite-state automaton in which the overall
course of the computation is completely determined by the
program, the starting state, and the initial inputs. The
class of problems solvable by such automata is the class P
(see polynomial-time algorithm).
(1996-05-03)
|
finite automaton
(foldoc) | Finite State Machine
acceptor
Finite Automata
Finite Automaton
Finite State Automata
Finite State Automaton
NFA
(FSM or "Finite State
Automaton", "transducer") An abstract machine consisting of
a set of states (including the initial state), a set of
input events, a set of output events, and a state transition
function. The function takes the current state and an input
event and returns the new set of output events and the next
state. Some states may be designated as "terminal states".
The state machine can also be viewed as a function which maps
an ordered sequence of input events into a corresponding
sequence of (sets of) output events.
A deterministic FSM (DFA) is one where the next state is
uniquely determinied by a single input event. The next state
of a nondeterministic FSM (NFA) depends not only on the
current input event, but also on an arbitrary number of
subsequent input events. Until these subsequent events occur
it is not possible to determine which state the machine is in.
It is possible to automatically translate any nondeterministic
FSM into a deterministic one which will produce the same
output given the same input. Each state in the DFA represents
the set of states the NFA might be in at a given time.
In a probabilistic FSM [proper name?], there is a
predetermined probability of each next state given the
current state and input (compare Markov chain).
The terms "acceptor" and "transducer" are used particularly in
language theory where automata are often considered as
abstract machines capable of recognising a language (certain
sequences of input events). An acceptor has a single
Boolean output and accepts or rejects the input sequence by
outputting true or false respectively, whereas a transducer
translates the input into a sequence of output events.
FSMs are used in computability theory and in some practical
applications such as regular expressions and digital logic
design.
See also state transition diagram, Turing Machine.
[J.H. Conway, "regular algebra and finite machines", 1971, Eds
Chapman & Hall].
[S.C. Kleene, "Representation of events in nerve nets and
finite automata", 1956, Automata Studies. Princeton].
[Hopcroft & Ullman, 1979, "Introduction to automata theory,
languages and computations", Addison-Wesley].
[M. Crochemore "tranducters and repetitions",
Theoritical. Comp. Sc. 46, 1986].
(2001-09-22)
|
finite state automaton
(foldoc) | Finite State Machine
acceptor
Finite Automata
Finite Automaton
Finite State Automata
Finite State Automaton
NFA
(FSM or "Finite State
Automaton", "transducer") An abstract machine consisting of
a set of states (including the initial state), a set of
input events, a set of output events, and a state transition
function. The function takes the current state and an input
event and returns the new set of output events and the next
state. Some states may be designated as "terminal states".
The state machine can also be viewed as a function which maps
an ordered sequence of input events into a corresponding
sequence of (sets of) output events.
A deterministic FSM (DFA) is one where the next state is
uniquely determinied by a single input event. The next state
of a nondeterministic FSM (NFA) depends not only on the
current input event, but also on an arbitrary number of
subsequent input events. Until these subsequent events occur
it is not possible to determine which state the machine is in.
It is possible to automatically translate any nondeterministic
FSM into a deterministic one which will produce the same
output given the same input. Each state in the DFA represents
the set of states the NFA might be in at a given time.
In a probabilistic FSM [proper name?], there is a
predetermined probability of each next state given the
current state and input (compare Markov chain).
The terms "acceptor" and "transducer" are used particularly in
language theory where automata are often considered as
abstract machines capable of recognising a language (certain
sequences of input events). An acceptor has a single
Boolean output and accepts or rejects the input sequence by
outputting true or false respectively, whereas a transducer
translates the input into a sequence of output events.
FSMs are used in computability theory and in some practical
applications such as regular expressions and digital logic
design.
See also state transition diagram, Turing Machine.
[J.H. Conway, "regular algebra and finite machines", 1971, Eds
Chapman & Hall].
[S.C. Kleene, "Representation of events in nerve nets and
finite automata", 1956, Automata Studies. Princeton].
[Hopcroft & Ullman, 1979, "Introduction to automata theory,
languages and computations", Addison-Wesley].
[M. Crochemore "tranducters and repetitions",
Theoritical. Comp. Sc. 46, 1986].
(2001-09-22)
|
minimal automaton
(foldoc) | minimal automaton
An automaton possessing with redundant states.
(1996-05-03)
|
nondeterministic automaton
(foldoc) | nondeterministic automaton
probabilistic automaton
(Or "probabilistic automaton") An automaton in
which there are several possible actions (outputs and next
states) at each state of the computation such that the overall
course of the computation is not completely determined by the
program, the starting state, and the initial inputs.
See also nondeterministic Turing Machine.
(1996-05-07)
|
probabilistic automaton
(foldoc) | nondeterministic automaton
probabilistic automaton
(Or "probabilistic automaton") An automaton in
which there are several possible actions (outputs and next
states) at each state of the computation such that the overall
course of the computation is not completely determined by the
program, the starting state, and the initial inputs.
See also nondeterministic Turing Machine.
(1996-05-07)
|
|