<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
a	O
deterministic	B-Application
automaton	I-Application
is	O
a	O
concept	O
of	O
automata	B-Application
theory	I-Application
in	O
which	O
the	O
outcome	O
of	O
a	O
transition	O
from	O
one	O
state	B-Application
to	O
another	O
is	O
determined	O
by	O
the	O
input	O
.	O
</s>
<s>
A	O
common	O
deterministic	B-Application
automaton	I-Application
is	O
a	O
deterministic	B-General_Concept
finite	I-General_Concept
automaton	I-General_Concept
(	O
DFA	B-General_Concept
)	O
which	O
is	O
a	O
finite	O
state	B-Application
machine	O
where	O
for	O
each	O
pair	O
of	O
state	B-Application
and	O
input	O
symbol	O
there	O
is	O
one	O
and	O
only	O
one	O
transition	O
to	O
a	O
next	O
state	B-Application
.	O
</s>
<s>
DFAs	B-General_Concept
recognize	O
the	O
set	O
of	O
regular	B-General_Concept
languages	I-General_Concept
and	O
no	O
other	O
languages	O
.	O
</s>
<s>
A	O
standard	O
way	O
to	O
build	O
a	O
deterministic	B-General_Concept
finite	I-General_Concept
automaton	I-General_Concept
from	O
a	O
nondeterministic	B-General_Concept
finite	I-General_Concept
automaton	I-General_Concept
is	O
the	O
powerset	B-General_Concept
construction	I-General_Concept
.	O
</s>
