Regular language
= Regular language
{wiki}
A language is regular exactly when it is accepted by a finite automaton, or equivalently has finitely many Myhill-Nerode classes.
= Regular language
{wiki}
A language is regular exactly when it is accepted by a finite automaton, or equivalently has finitely many Myhill-Nerode classes.