Skip to main content
SpringerLink
Log in
Book cover

International Conference on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 1987: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 341–349Cite as

It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent thue system is torsion-free

  • Conference paper
  • First Online:

  • 158 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 356))

Abstract

It is shown that the following decision problems are solvable in polynomial time:

INSTANCE: A finite, weight-reducing, and confluent Thue system T on alphabet Σ.

1. QUESTION: Does the monoid

presented by (Σ;T) contain a non-trivial idempotent ?

2. QUESTION: Is the monoid

torsion-free ?

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.M. Auteberg, L. Boasson, G. Senizergues; Groups and NTS languages; J. Comp. System Sci. 35 (1987), 243–267.

    Article  Google Scholar 

  2. R.V. Book; Confluent and other types of Thue systems; J. Assoc. Comput. Mach. 29 (1982), 171–182.

    Google Scholar 

  3. R.V. Book; Thue systems as rewriting systems; in: J.P. Jouannaud (ed.), Rewriting Techniques and Applications, Lect. Notes Comp. Science 202 (1985), 63–94.

    Google Scholar 

  4. V. Diekert; Some properties of weight-reducing presentations; Technical Rep. TUM-18710; Institut für Informatik, Techn. Universität München, 1987.

    Google Scholar 

  5. M.J. Dunwoody; The accessibility of finitely presented groups; Inventiones Mathematicae 81 (1985), 449–457.

    Article  Google Scholar 

  6. D. Kapur, P. Narendran; The Knuth-Bendix completion procedure and Thue systems; SIAM J. Comput. 14 (1985), 1052–1072.

    Article  Google Scholar 

  7. G. Lallement; On monoids presented by a single relation; J. Algebra 32 (1974), 370–388.

    Article  Google Scholar 

  8. K. Madlener, F. Otto; On groups having finite monadic Church-Rosser presentations; in: H. Jürgensen, G. Lallement, H. Weinert (eds.), Semigroups, Theory and Applications, Lecture Notes in Mathematics 1320, Springer Verlag 1988, pp. 218–234.

    Google Scholar 

  9. A. Markov; Impossibility of algorithms for recognizing some properties of associative systems; Dokl. Akad. Nauk SSSR 77 (1951), 953–956.

    Google Scholar 

  10. A. Mostowski; Review of [9]; J. Symbolic Logic 17 (1952), 151–152.

    Google Scholar 

  11. D.E. Muller, P.E. Schupp; Groups, the theory of ends, and context-free languages; J. Comp. System Sci. 26 (1983), 295–310.

    Article  Google Scholar 

  12. F. Otto; Elements of finite order for finite monadic Church-Rosser Thue systems; Transactions Amer. Math. Soc. 291 (1985), 629–637.

    Google Scholar 

  13. F. Otto; On deciding whether a monoid is a free monoid or is a group; Acta Informatica 23 (1986), 99–110.

    Google Scholar 

  14. L.X. Zhang; A polynomial-time algorithm to decide a monoid presented by a regular monadic Church-Rosser Thue system to be a group; Theor. Comp. Sci., to appear.

    Google Scholar 

Download references

Author information

Author notes

  1. Paliath Narendran & Friedrich Otto

    Present address: Department of Computer Science, University of Calgary, T2N 1N4, Calgary, Alberta, Canada

Authors and Affiliations

  1. Department of Computer Science, State University of New York, 12222, Albany, N.Y., U.S.A.

    Paliath Narendran & Friedrich Otto

Authors
  1. Paliath Narendran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Llorenç Huguet Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Narendran, P., Otto, F. (1989). It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent thue system is torsion-free. In: Huguet, L., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1987. Lecture Notes in Computer Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51082-6_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-51082-6_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51082-6

  • Online ISBN: 978-3-540-46150-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation