THE GRAMMATICAL COMPLEXITY AND SYMMETRY BREAKING OF SYMMETRICAL DYNAMICAL SYSTEMS |
| |
| Authors: | Lu Qinhe |
| |
| Affiliation: | MathematicsDepartment,SuzhouUniversity |
| |
| Abstract: | In this paper we discuss the grammatical complexity of dynamical systems, Which satisfy antisymmetric condition and their iteratve interval can be diveded into three monotone subintervals. A necessary and sufficient candition for the language determined by this system being regular language is proved. Using the minimal DFA, symmetry breaking is analysed. |
| |
| Keywords: | complexity minimal DFA symmetry breaking. |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
