Abstract
Due to their many nice properties groups with automatic structure (automatic groups) have received a lot of attention in the literature. The multiplication of an automatic group can be realized through finite automata based on a regular set of (not necessarily unique) representatives for the group, and hence, each automatic group has a tractable word problem and low derivational complexity. Consequently it has been asked whether corresponding results also hold for monoids with automatic structure. Here we show that there exist finitely presented monoids with automatic structure that cannot be presented through finite and convergent string-rewriting systems, thus answering a question in the negative that is still open for the class of automatic groups. Secondly, we present an automatic monoid that has an exponential derivational complexity, which establishes another difference to the class of automatic groups. In fact, both our example monoids are bi-automatic. In addition, it follows from the first of our examples that a monoid which is given through a finite, noetherian, and weakly confluent string-rewriting system need not have finite derivation type.
This work was supported by the Deutsche Forschungsgemeinschaft (Projekte Ma 1208/5-1 und Ot 79/4-1).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J.M. Alonso. Combings of groups. In G. Baumslag and C.F. Miller III, editors, Algorithms and Classification in Combinatorial Group Theory, Math. Sciences Research Institute Publ. 23, pages 165–178. Springer-Verlag, New York, 1992.
R.V. Book. Confluent and other types of Thue systems. J. Association Computing Machinery, 29:171–182, 1982.
R.V. Book. The power of the Church-Rosser property in string-rewriting systems. In D.W. Loveland, editor, 6th Conference on Automated Deduction, Lecture Notes in Computer Science 138, pages 360–368. Springer-Verlag, Berlin, 1982.
R.V. Book. Decidable sentences of Church-Rosser congruences. Theoretical Computer Science, 24:301–312, 1983.
R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.
CM. Campbell, E.F. Robertson, N. Ruskuc, and R.M. Thomas. Automatic Semigroups. Technical Report No. 1997/29, Department of Mathematics and Computer Science, University of Leicester, 1997.
R. Cremanns and F. Otto. Finite derivation type implies the homological finiteness condition FP3. Journal of Symbolic Computation, 18:91–112, 1994.
R. Cremanns and F. Otto. For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP3. Journal of Symbolic Computation, 22:155–177, 1996.
D.B.A. Epstein. Word Processing In Groups. Jones and Bartlett Publishers, 1992.
S.M. Gersten. Dehn functions and l1-norms of finite presentations. In G. Baumslag and C.F. Miller III, editors, Algorithms and Classification in Combinatorial Group Theory, Math. Sciences Research Institute Publ. 23, pages 195–224. Springer-Verlag, New York, 1992.
R.H. Gilman. Computations with rational subsets of confluent groups. In J. Fitch, editor, Proc. EUROSAM 84, Lecture Notes in Computer Science 174, pages 207–212. Springer-Verlag, Berlin, 1984.
S.M. Gersten and H.B. Short. Rational subgroups of biautomatic groups. Annals of Mathematics, 134:125–158, 1991.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation Addison-Wesley, Reading, M.A., 1979.
J.F.P. Hudson. Regular rewrite systems and automatic structures. In J. Almeida, G.M.S. Gomes, and P.V. Silva, editors, Semigroups, Automata and Languages, pages 145–152. World Scientific, Singapure, 1996.
K. Madlener and F. Otto. Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. Journal of Symbolic Computation, 1:383–418, 1985.
K. Madlener, P. Narendran, F. Otto, and L. Zhang. On weakly confluent monadic string-rewriting systems. Theoretical Computer Science, 113:119–165, 1993.
C. ó'DÚnlaing. Infinite regular Thue systems. Theoretical Computer Science, 25:171–192, 1983.
F. Otto. On deciding whether a monoid is a free monoid or is a group. Acta Informatica, 23:99–110, 1986.
F. Otto and Y. Kobayashi. Properties of monoids that are presented by finite convergent string-rewriting systems — a survey. In D.Z. Du and K. Ko, editors, Advances in Algorithms, Languages and Complexity, pages 226–266. Kluwer Academic Publ., Dordrecht, 1997.
F. Otto and A. Sattler-Klein. Some remarks on finitely presented monoids with automatic structure. Mathematische Schriften Kassel No. 9/97, Fachbereich Mathematik/Informatik, Universität Kassel, 1997.
S.J. Pride. Geometric methods in combinatorial semigroup theory. In J. Fountain, editor, Proc. of Int. Conf. on Semigroups, Formal Languages, and Groups, pages 215–232. Kluwer Academic Publ., Dordrecht, 1995.
C.C. Squier, F. Otto, and Y. Kobayashi. A finiteness condition for rewriting systems. Theoretical Computer Science, 131:271–294, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Otto, F., Sattler-Klein, A., Madlener, K. (1998). Automatic monoids versus monoids with finite convergent presentations. In: Nipkow, T. (eds) Rewriting Techniques and Applications. RTA 1998. Lecture Notes in Computer Science, vol 1379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052359
Download citation
DOI: https://doi.org/10.1007/BFb0052359
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64301-2
Online ISBN: 978-3-540-69721-3
eBook Packages: Springer Book Archive