Main Page
|
See live article
|
Alphabetical index
A
finite language
is a
formal language
containing a
finite
number of
strings
. The finite languages are the simplest languages. All finite languages are
regular
.