Church-Rosser Thue Systems that Present Free Monoids

@article{Otto1986ChurchRosserTS,
  title={Church-Rosser Thue Systems that Present Free Monoids},
  author={Friedrich Otto},
  journal={SIAM J. Comput.},
  year={1986},
  volume={15},
  pages={786-792}
}
  • Friedrich Otto
  • Published in SIAM J. Comput. 1986
  • Mathematics, Computer Science
  • It is undecidable in general whether the monoid presented by a given Thue system is a free monoid. Here it is shown that this question is decidable for Church–Rosser Thue systems. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    Contributions of Ronald V. Book to the Theory of String-Rewriting Systems

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    String-Rewriting Systems

    On deciding whether a monoid is a free monoid or is a group

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES

    O ’ vFO , Complexity results on the conjugacy problem for monoids , Theoret

    • F. P.NARENDRANAND
    • Comput . Sci .
    • 1984

    MARKOV , Impossibility of algorithms for recognizing some properties of associative systems , Dokl

    • A.
    • . Akad . Nauk SSSR
    • 1976