| THE MINIMAL DFA FOR EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL |
| |
| 作者姓名： | 王益 |
| |
| 作者单位： | Department of |
| |
| 摘 要： | Combining the theory of symbolic dynamics-with the. formal language theory, we determine the minimal deterministic finite automata (DFA ) accepting the formal languages generated by eventually periodic kneading sequences of unimodal maps on an interval.
|
| 关 键 词： | 动力系统 单峰图 形式语言 DFA 周期性 |
THE MINIMAL DFA FOR EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL |
| |
| Wang Yi.THE MINIMAL DFA FOR EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL[J].Journal of Suzhou University(Natural Science),1994,10(2):104-112. |
| |
| Authors: | Wang Yi |
| |
| Affiliation: | DepartmentofMathematics,SuzhouUniversity |
| |
| Abstract: | Combining the theory of symbolic dynamics with the formal language theory, we determine the minimal deterministic finite automata (DFA) Aaccepting the formal languages generated by eventually periodic kneading sequences of unimodal maps on an interval. |
| |
| Keywords: | Dynamical system Unimodal map Kneading sequence Minimal exact form Minimal DFA |
| 本文献已被 CNKI 维普 等数据库收录！ |
