Doklady Mathematics

, Volume 80, Issue 2, pp 679–683 | Cite as

Upper bound on the derivational complexity in some word rewriting system

  • S. I. Adian
Mathematics
  • 34 Downloads

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Hofbauer and J. Waldmann, Information Processing Letters. 98(1) (2000).Google Scholar
  2. 2.
    S. I. Adian, “Defining Relations and Algorithmic Problems for Groups and Semigroups,” Proc. Steklov Inst. Math., Vol. 85 (1966) [American Mathematical Society (1967)].Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2009

Authors and Affiliations

  • S. I. Adian
    • 1
  1. 1.Steklov Institute of MathematicsRussian Academy of SciencesMoscowRussia

Personalised recommendations