Abstract
We consider the formal languages generated from kneading sequences (KS) in unimodal maps on an interval. The usefulness of an equivalence relation RL. and the Myhill-Nerode theorem in dynamical systems has been explored. A necessary and sufficient condition for the languages being 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
