摘要
研究了识别Dyck码和n阶广义Motzkin码的整齐确定自动机,并得到识别1阶广义Motzkin码M1和Motzkin码M及其星语言的最小自动机.
The trim deterministic automata recognizing the Dyck code and the generalized Motzkin code are studied.The minimal automata recognizing the generalized Motzkin code M1 over one letter,the Motzkin code M,and their star languages are given.
出处
《玉溪师范学院学报》
2011年第4期9-13,共5页
Journal of Yuxi Normal University