Conjugacy in Free Inverse Monoids
暂无分享,去创建一个
[1] John C. Meakin. Automata and the word problem , 1988, Formal Properties of Finite Automata and Applications.
[2] H. E. Scheiblich. Free inverse semigroups , 1972 .
[3] G. Lallement. Semigroups and combinatorial applications , 1979 .
[4] Paliath Narendran,et al. The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete , 1984, Inf. Control..
[5] Jean Pierre Duval,et al. Factorizing Words over an Ordered Alphabet , 1983, J. Algorithms.
[6] Kellogg S. Booth,et al. Lexicographically Least Circular Substrings , 1980, Inf. Process. Lett..
[7] M. Schützenberger,et al. The equation $a^M=b^Nc^P$ in a free group. , 1962 .
[8] Christine Duboc,et al. On Some Equations in Free Partially Commutative Monoids , 1986, Theor. Comput. Sci..
[9] J. Howie. An introduction to semigroup theory , 1976 .
[10] Friedrich Otto,et al. Conjugacy in monoids with a special Church-Rosser presentation is decidable , 1984 .
[11] Walter Douglas Munn. Free Inverse Semigroups , 1974 .
[12] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[13] P. Narendran,et al. The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems , 1986, Theor. Comput. Sci..
[14] Louxin Zhang. Conjugacy in special monoids , 1991 .