English Wikipedia - The Free Encycl...
Download this dictionary
Semiautomaton
In
mathematics
and
theoretical computer science
, a
semiautomaton
is a
deterministic finite automaton
having inputs but no output. It consists of a
set
Q
of
states
, a set Σ called the input alphabet, and a function
T
:
Q
× Σ →
Q
called the transition function.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License