Algorithms for Properties of Factor Semigroups on Graphs
暂无分享,去创建一个
[1] J. Howie. Fundamentals of semigroup theory , 1995 .
[2] Thomas Sudkamp,et al. Languages and Machines , 1988 .
[3] Lenwood S. Heath,et al. Opal: A System for Computing Noncommutative Gröbner Bases , 1997, RTA.
[4] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.
[5] B. Keller. Algorithms and orders for finding noncommutative Grobner bases , 1998 .
[6] D. West. Introduction to Graph Theory , 1995 .
[7] Tatiana Gateva-Ivanova,et al. On Recognisable Properties of Associative Algebras , 1988, J. Symb. Comput..
[8] Peter M. Higgins,et al. Techniques of semigroup theory , 1991 .
[9] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[10] Edward L. Green,et al. Constructing projective resolutions , 1993 .
[11] Raffaele Giancarlo,et al. Dynamic Dictionary Matching , 1994, J. Comput. Syst. Sci..
[12] L. Márki,et al. On semisimple classes of semigroups with zero , 1981 .
[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[14] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[15] Edward L. Green,et al. Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases , 2000, J. Symb. Comput..
[16] Edward L. Green,et al. On the homology of quotients of path algebras , 1987 .
[17] M. W. Shields. An Introduction to Automata Theory , 1988 .
[18] Nik Ruskuc. On Large Subsemigroups and Finiteness Conditions of Semigroups , 1998 .