We consider the formal languages generated from kneading sequences (KS
) in unimodal maps on an interval. The usefulness of an equivalence re
lation R(L) and the Myhill-Nerode theorem in dynamical systems has bee
n explored. A necessary and sufficient condition for the languages bei
ng regular is proved. The minimal DFA for periodic KS is determined. A
simple proof is provided to show that the language of the Feigenbaum
attractor is not regular.