THE STRONG RECOGNIZABILITY AND SEMI-RECOGNIZABILITY OF INTEGRAL FAMILY OF LAN-GUAGES AND THE STRONG REPLACEABILITY OF FAMILY OF LANGUAGES

THE STRONG RECOGNIZABILITY AND SEMI-RECOGNIZABILITY OF INTEGRAL FAMILY OF LAN-GUAGES AND THE STRONG REPLACEABILITY OF FAMILY OF LANGUAGES

原文传递

导出

摘要 <正> Let ∑ be a finite alphabet, ∑~* a free monoid generated by ∑, u∈∑~* a word on ∑,L(?)∑~* a language on ∑,X(?)(∑)--{φ} a family of language,

作者雷忠学

机构地区 Department of Mathematics

出处《Chinese Science Bulletin》 SCIE EI CAS 1986年第9期644-645,共2页

关键词 MONOID LETTER

分类号 O1 [理学—基础数学]

引文网络
相关文献

1许光午.COMMUTATIVELY CLOSED IDEAL LANGUAGES AND THEIR PRIMARY DECOMPOSITIONS[J].Chinese Science Bulletin,1986,31(17):1163-1166.
2XIE Huimin (Department of Mathematics, Suzhou University, Suzhou 215006, China).THE COMPLEXITY OF LIMIT LANGUAGES OF CELLULAR AUTOMATA: AN EXAMPLE[J].Journal of Systems Science & Complexity,2001,14(1):17-30. 被引量：8
3王传洪.A NEW CHARACTERIZATION OF NONDETERMINISTICALLY RECOGNIZABLE FAMILIES OF LANGUAGES^(**)[J].Chinese Annals of Mathematics,Series B,1991,12(1):1-12.
4章亮.MEASURES OF CODES AND FINITE MAXIMAL CODES[J].Chinese Science Bulletin,1987,32(16):1081-1084.
5朱占敏.Noether环的一个特征[J].重庆师范学院学报（自然科学版）,2001,18(3):60-61. 被引量：2
6Nancy Chitera.Some Insights into the Dilemma of Distinguishing the Formal and Informal Mathematical Language in Local Languages[J].US-China Education Review(A),2016,6(6):360-370.
7施惟慧.A STABILITY STUDY OF NAVIER-STOKES EQUATIONS (Ⅲ)[J].Applied Mathematics and Mechanics(English Edition),1994,15(12):1125-1130.
8Wang Yi,Morita Kenichi.COMPLEXITY OF EVOLUTION LANGUAGES OF THE ELEMENTARY CELLULAR AUTOMATON OF RULE 146[J].Applied Mathematics(A Journal of Chinese Universities),2006,21(4):418-428. 被引量：1
9张洛新,郭聿琦.INFINITE STRONG CODES[J].Chinese Science Bulletin,1987,32(24):1669-1672.
10WangYi,JiangZhisong.EVOLUTION COMPL EXITY OF THE ELEMENTARY CELLULAR AUTOMATON OF RUL E 2 2[J].Applied Mathematics(A Journal of Chinese Universities),2002,17(4):404-412. 被引量：7

Chinese Science Bulletin

1986年第9期

浏览历史

内容加载中请稍等...

THE STRONG RECOGNIZABILITY AND SEMI-RECOGNIZABILITY OF INTEGRAL FAMILY OF LAN-GUAGES AND THE STRONG REPLACEABILITY OF FAMILY OF LANGUAGES

相关作者

相关机构

相关主题

浏览历史