Automatic semigroups

Theoretical Computer Science

Volumn 250, Issue 1-2, 2001, Pages 365-391

  Campbell, Colin M ^a   Robertson, Edmund F ^a   Ruškuc, Nikola ^a   Thomas, Richard M ^b  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Automatic; Group; Regular; Semigroup

Indexed keywords

AUTOMATION; COMPUTATIONAL COMPLEXITY;

SEMIGROUPS;

FINITE AUTOMATA;

EID: 0034899693     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(99)00151-6     Document Type: Article

References (29)

1. G. Baumslag, S.M. Gersten, M. Shapiro, H. Short, Automatic groups and amalgams, J. Pure Appl. Algebra 76 (1991) 229-316.
2. C.M. Campbell, E.F. Robertson, N. Ruškuc, R.M. Thomas, Reidemeister-Schreier type rewriting for semigroups, Semigroup Forum 51 (1995) 47-62.
3. C.M. Campbell, E.F. Robertson, N. Ruškuc, R.M. Thomas, Direct products of automatic semigroups, submitted for publication.
4. C.M. Campbell, E.F. Robertson, N. Ruškuc, R.M. Thomas, Automatic completely-simple semigroups, submitted for publication.
5. J.W. Cannon, D.B.A. Epstein, D.F. Holt, S.V.F. Levy, M.S. Paterson, W.P. Thurston, Word Processing in Groups, Jones and Bartlett Publishers, 1992.
6. A.J. Duncan, E.F. Robertson, N. Ruškuc, Automatic monoids and change of generators, Math. Proc. Cambridge Philos. Soc., to appear.
7. D.B.A. Epstein, D.F. Holt, S.E. Rees, The use of Knuth-Bendix methods to solve the word problem in automatic groups, J. Symbolic Comput. 12 (1991) 397-414.
8. S.M. Gersten, H. Short, Small cancellation theory and automatic groups, Invent. Math. 102 (1990) 305-334.
9. S.M. Gersten, H. Short, Small cancellation theory and automatic groups 2, Invent. Math. 105 (1991) 641-662.
10. R.H. Gilman, Automatic groups and string rewriting, in: H. Comon, J.-P. Jouannaud (Eds.), Term Rewriting, Lecture Notes in Computer Science, vol. 909, Springer, Berlin, 1995, pp. 127-134.
11. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
12. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
13. J.M. Howie, Fundamentals of Semigroup Theory, Oxford University Press, Oxford, 1995.
14. J.F.P. Hudson, Regular rewrite systems and automatic structures, in: J. Almeida, G.M.S. Gomes, P.V. Silva (Eds.), Semigroups, Automata and Languages, World Scientific, Singapore, 1996, pp. 145-152.
15. A. Jura, Determining ideals of a given finite index in a finitely presented semigroup, Demonstratio Math. 11 (1978) 813-827.
16. G. Lallement, Semigroups and Combinatorial Applications, John Wiley, New York, 1979.
17. F. Otto, On Dehn functions of finitely presented biautomatic monoids, Mathematische Schriften Kassel, Preprint 8 (1998).
18. F. Otto, On s-regular prefix-rewriting systems and automatic structures, Mathematische Schriften Kassel, Preprint 9 (1998).
19. F. Otto, A. Sattler-Klein, K. Madlener, Automatic monoids versus monoids with finite convergent presentations, in: T. Nipkow (Ed.), Rewriting Techniques and Applications - Proceedings RTA '98, Lecture Notes in Computer Science, vol. 1379, Springer, New York, 1998, pp. 32-46.
20. P. Papasoglu, Strongly geodesically automatic groups are hyperbolic, Invent. Math. 121 (1995) 323-334.
21. M. Pelletier, Boolean closure and unambiguity of rational sets, in: M.S. Paterson (Ed.), Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 443, Springer, Berlin, 1990, pp. 512-525.
22. M. Pelletier, J. Sakarovitch, Easy multiplications II. Extensions of rational semigroups, Inform. Comput. 88 (1990) 18-59.
23. L. Rédel, The Theory of Finitely Generated Commutative Semigroups, Pergamon Press, Oxford, 1965.
24. E.F. Robertson, N. Ruškuc, J. Wiegold, Generators and relations of direct products of semigroups, Trans. Amer. Math. Soc. 350 (1998) 2665-2685.
25. N. Ruškuc, On large subsemigroups and finiteness conditions on semigroups, Proc. London Math. Soc. 76 (1998) 383-405.
26. N. Ruškuc, R.M. Thomas, Syntactic and Rees indices of subsemigroups, J. Algebra 205 (1998) 435-450.
27. J. Sakarovitch, Easy Multiplications I. The realm of Kleene's theorem, Inform. Comput. 74 (1987) 173-197.
28. M. Shapiro, A note on context-sensitive languages and word problems, Internat. J. Algebra Comput. 4 (1994) 493-497.
29. H. Short, An introduction to automatic groups, in: J. Fountain (Ed.), Semigroups, Formal Languages and Groups, NATO ASI Series, vol. C466, Kluwer, Dordrecht, 1995, pp. 233-253.