Time-complexity of the word problem for semigroups and the Higman Embedding Theorem

International Journal of Algebra and Computation

Volumn 8, Issue 2, 1998, Pages 235-294

  Birget, Jean Camille ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032328946     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218196798000132     Document Type: Article

References (54)

1. J. Avenhaus and K. Madlener, Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität, Acta Informatica 9 (1977), 87-104.
2. J. Avenhaus and K. Madlener, Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen, Acta Informatica 9 (1978), 183-193.
3. J. Balcázar, J. Díaz and J. Gabarrò, Structural Complexity, Vol. I, Springer Verlag, 1988.
4. Ch.H. Bennett, Logical reversibility of computation, IBM J. of Research and Development 17 (1973), 525-532.
5. Ch.H. Bennett, Time/space trade-offs for reversible computation, SIAM J. of Computing 18 (1989), 766-776.
6. G. Bauer and F. Otto, Finite complete rewriting systems and the complexity of the word problem, Acta Informatica 21 (1984), 521-540.
7. J. C. Birget, Reductions and functors from problems to word problems, submitted.
8. J. C. Birget, Infinite rewriting systems and complexity, J. Symbolic Computation, submitted.
9. J. C. Birget, S. Margolis and J. Meakin, On the word problem for tensor products and amalgams of monoids, Int. J. of Algebra and Computation (submitted).
10. R. V. Book, S. A. Greibach and B. Wegbreit, Time-and tape-bounded Turing acceptors and AFLs, J. Comput. Syst. Sci. 4 (1970), 606-621.
11. F. Cannonito, Hierarchies of computable groups and word problems, J. Symbolic Logic 31 (1966), 376-392.
12. F. Cannonito and R. Gatterdam, The computability of group constructions, Part I, in Word Problems, eds. W. Boone, F. Cannonito and R. Lyndon, North-Holland, 1973.
13. D. E. Cohen, Combinatorial Group Theory: A Topological Approach, LMS 14, Cambridge U. Press, 1989.
14. D. E. Cohen, K. Madlener and F. Otto, Separating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups, Mathematical Logic Quarterly 39 (1993), 143-157.
15. D. B. A. Epstein, J. W. Cannon, D. F. Holt, S. V. F. Levy, M. S. Paterson and W. P. Thurston, Word Processing in Groups, Jones and Barlett, 1992.
16. R. W. Floyd and R. Beigel, The Language of Machines: An Introduction to Computability and Formal Languages, Computer Science Press, Freeman & Co., 1994.
17. R. Gatterdam, The Higman theorem for primitive recursive groups - a preliminary report, in Word Problems, eds. W. Boone, F. Cannonito and R. Lyndon, North-Holland, 1973, pp. 421-425.
18. n(A)-computable groups, in Conference on Group Theory, eds. R. Gatterdam and K. Weston, Lecture Notes in Mathematics 319, Springer-Verlag, 1973, pp. 71-74.
19. 1-norms of finite presentations, in Algorithms and Classification in Combinatorial Group Theory, eds. G. Baumslag and C. F. Miller, MSRI Publications 23, Springer-Verlag, 1992.
20. M. Gromov, Hyperbolic groups, in Essays in Group Theory, ed. S. M. Gersten, MSRI Series vol. 8, Springer Verlag, 1987, pp. 75-263.
21. J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Volumes A and B, MIT Press/Elsevier, 1990.
22. F. C. Hennie, One-tape off-line Turing machine computations, Information and Control 8 (1965), 553-578.
23. T. N. Hibbard, Context-limited grammars, J. Assoc. Comput. Machinery 21 (1974), 446-453.
24. P. M. Higgins, Techniques of Semigroup Theory, Oxford University Press, 1992.
25. G. Higman, Subgroups of finitely presented groups, Proc. Royal Society of London, Series A, 262, 1961, pp. 455-475.
26. J. M. Howie, Embedding theorems with amalgamation for semigroups, Proc. London Mathematical Society, 12 (3) 1962, pp. 511-534.
27. J. M. Howie, Amalgamation: A survey, in Semigroups, eds. C. Bonzini, A. Cherubini and C. Tibiletti, World Scientific, 1993.
28. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
29. E. V. Kashintsev, Graphs and the word problems for finitely presented semigroups, Uch. Zap. Tul. Fed. Inst. 2 (1970), 290-302 (Russian).
30. R. Ladner, N. Lynch and A. Selman, A comparison of polynomial-time reducibilities, Theor. Comput. Sci. 1 (1975), 103-123.
31. nu, où θ est un isomorphisme de codes, Comptes Rendus de l'Académie des Science, Paris, 257 (18) (1963), 2597-2600.
32. H. R. Lewis and Ch. Papadimitriou, Symmetric space-bounded computation, Theor. Comput. Sci. 19 (1982), 161-187.
33. R. Lyndon and P. Schupp, Combinatorial Group Theory, Springer-Verlag, 1977.
34. R. Levine and A. Sherman, A note on Bennett's space-time tradeoff for reversible computations, SIAM J. Comput. 19 (1990), 673-677.
35. K. Madlener and F. Otto, Pseudo-natural algorithms for the word problem for finitely presented monoids and groups, J. Symbolic Computation 1 (1985), 383-418.
36. R. McNaughton, Elementary Computability, Formal Languages, and Automata, Prentice-Hall, 1982.
37. V. Murski, Isomorphic embeddability of semigroups with countable sets of defining relations in finitely defined semigroups, Matematicheskii Zametki 1 (1967), 217-224 (English translation, pp. 145-149).
38. A. Yu. Ol'shanskii, Hyperbolicity of groups with subquadratic isoperimetric inequality, Int. J. Algebra and Computation 1 (1991), 281-290.
39. Ch. Papadimitriou, Computational Complexity, Addison Wesley, 1994.
40. W. J. Paul, N. Pippenger, E. Szemerédi and W. T. Trotter, On determinism versus nondeterminism and related problems, Proc. 24th IEEE Annual Symposium on Foundations of Computer Science, 1983, pp. 429-438.
41. J. H. Remmers, On the geometry of semigroup presentations, Advances in Math. 36 (1980), 283-296.
42. K. R. Reischuk, Einführung in die Komplexitätstheorie, Teubner, Stuttgart, 1990.
43. J. Rotman, An Introduction to the Theory of Groups, Fourth edition, Springer-Verlag, 1994.
44. M. V. Sapir, J. C. Birget and E. Rips, Isoperimetric and isodiametric functions of groups, submitted.
45. M. V. Sapir, J. C. Birget, A. Ol'shanskii and E. Rips, On the Higman embedding theorem with complexity, for groups (submitted).
46. C. C. Sims, Computation with Finitely Presented Groups, Cambridge University Press, 1994.
47. J. Stillwell, The word problem and the isomorphism problem for groups, Bulletin (new series) of the AMS, 6 (1982), 33-56.
48. M. Valiev, One theorem of G. Higman, Algebra i Logika 7 (1968), 9-22 (English translation, pp. 135-143.)
49. M. Valiev, On the complexity of the identity problem for finitely defined groups, Algebra i Logika 8 (1969), 5-43 (English translation, pp. 2-21).
50. M. Valiev, On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups, in Mathematical Foundations of Computer Science, ed. J. Becvar, Lecture Notes in Computer Science 32, (1975), pp. 432-438.
51. S. Waack, Tape complexity of word problems, Report R-MATH-04/81, Akademie der Wissenschaften der DDR, Institut für Mathematik, Berlin, 1981.
52. K. Wagner and G. Wechsung, Computational Complexity, Reidel, 1986.
53. C. K. Yap, Theory of Complexity Classes, Oxford Univ. Press (to appear).
54. M. Ziegler, Gruppen mit vorgeschriebenem Wortproblem, Mathematische Annalen 219 (1976), 43-51.