English Wikipedia - The Free Encycl...
Download this dictionary
Recognizable set
In
computer science
, more precisely in automata theory, a
recognizable set
of a monoid is a subset that can be distinguished by some morphism to a finite monoid. Recognizable sets are useful in
automata theory
,
formal languages
and
algebra
.
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