Description des monoïdes de type fini
暂无分享，去创建一个
[1] Jacques Sakarovitch. Théorème de transversale rationnelle pour les automates à pile déterministes , 1979, Theoretical Computer Science.
[2] O. Schreier,et al. Die Untergruppen der freien Gruppen , 1927 .
[3] Maurice Nivat,et al. Transduction des langages de Chomsky , 1968 .
[4] M. Fliess. Deux applications de la repr?sentation matricielle d'une s?rie rationnelle non commutative , 1971 .
[5] Marcel Paul Schützenberger,et al. La correspondance de Robinson , 1977 .
[6] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[7] R. Lyndon,et al. Combinatorial Group Theory , 1977 .
[8] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1965, Inf. Control..
[9] G. Lallement. Semigroups and combinatorial applications , 1979 .
[10] F. Levi,et al. Über die Untergruppen der freien Gruppen , 1933 .
[11] Pierre Cartier,et al. Problemes combinatoires de commutation et rearrangements , 1969 .
[12] Yehoshafat Give'on,et al. On Some Properties of the Free Monoids with Applications to Automata Theory , 1967, J. Comput. Syst. Sci..