Mathematical Notes

, Volume 92, Issue 1–2, pp 3–15 | Cite as

On a method for proving exact bounds on derivational complexity in thue systems

Article
  • 66 Downloads

Abstract

In this paper, the following system of substitutions in a 3-letter alphabet
$$\sum { = \left\langle {\left. {a,b,c} \right|a^2 \to bc,b^2 \to ac,c^2 \to ab} \right\rangle }$$
is considered. A detailed proof of results that were described briefly in the author’s paper [1] is presented. They give an answer to the specific question on the possibility of giving a polynomial upper bound for the lengths of derivations from a given word in the system Σ stated in the literature. The maximal possible number of steps in derivation sequences starting from a given word W is denoted by D(W). The maximum of D(W) for all words of length |W| = l is denoted by D(l). It is proved that the function D(W) on wordsW of given length |W| = m+2 reaches its maximum only on words of the form W = c2bm and W = bma2. For these words, the following precise estimate is established:
where ⌌3m2/2⌍ for odd |m| is the round-up of 3m2/2 to the nearest integer.

Keywords

word rewriting system derivational complexity Thue system polynomial upper bound left (right) divisibility of a word 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. I. Adian, “Upper bound on the derivational complexity in some word rewriting system,” Dokl. Ross. Akad. Nauk 428(3), 295–299 (2009) [Dokl. Math. 8 (2), 679–683 (2009)].Google Scholar
  2. 2.
    D. Hofbauer and J. Waldmann, “Termination of {aa → bc, bb → ac, cc → ab},” Inform. Process. Lett. 98(4), 156–158 (2006).MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    S. I. Adian, “Defining relations and algorithmic problems for groups and semigroups,” in Trudy Mat. Inst. Steklov (Nauka, Moscow, 1966), Vol. 85, pp. 3–123 [Proc. Steklov Inst. Math., Vol. 85, 3–152 (1966)].Google Scholar
  4. 4.
    S. I. Adian, The Burnside Problem and Identities in Groups (Nauka, Moscow, 1975) [in Russian].Google Scholar
  5. 5.
    H. Zantema, “Complexity of guided insertion-deletion in RNA-editing,” in Lecture Notes in Comput. Sci., Vol. 6031: Language and Automata Theory and Applications (Springer-Verlag, Berlin, 2010), pp. 608–619.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2012

Authors and Affiliations

  1. 1.Steklov Mathematical InstituteRussian Academy of SciencesSteklovRussia

Personalised recommendations