Encyclopedia > Finite language

  Article Content

Finite language

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.



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Quadratic formula

... \right) x + \frac{c}{a}=0 </math> which is equivalent to <math>x^2+\frac{b}{a}x=-\frac{c}{a}.</math> The equation is now in a form in which we ...

 
 
 
This page was created in 35.4 ms