摘要
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.
In this paper we discuss the grammatical complexity of dynamical systems,which satisfy antisymmetric condition and their iteratve interval can be divided into three monotone subintervals. A necessary and sufficient condition Jor the language determined by this system being regular language is proved.. Using the minimal DFA, symmetry breaking is analysed.
出处
《苏州大学学报（自然科学版）》
CAS
1994年第2期87-94,共8页
Journal of Soochow University(Natural Science Edition)
基金
This work is supported by National Basie Research Poject"Nonliear Science
