Repetitive Strings are not Context-Free

@article{Ross1982RepetitiveSA,
  title={Repetitive Strings are not Context-Free},
  author={Rockford J. Ross and Karl Winklmann},
  journal={ITA},
  year={1982},
  volume={16},
  pages={191-199}
}
— Let S be an alphabet. A string of theform xyyz with x, ze£* and y e T* is called répétitive. In this paper we prove that the set of répétitive strings over an alphabet of three or more letters is not context-free, settling a conjecture from [1]. Résumé. — Soit 2 un alphabet. Un mot contient un carré s'il est de la forme xyyz avec x, z e X* et ye£ + . Dans cet article, nous prouvons que V ensemble des mots contenant un carré sur un alphabet à trois lettres n'est pas algébrique, résolvant une… CONTINUE READING
15 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Avoidable Patierns in Strings of Symbols, Pacific Journal of Mathematics, Vol

  • D. R. BEAN, A. EHRENFEUCHT, G. F. MCNULTY
  • 85, (2),
  • 1979
Highly Influential
3 Excerpts

L, BOASSON and M

  • J. M. AUTEBERT, J. BEAUQUIER
  • NIVAT, Quelques problèmes ouverts en théorie des…
  • 1979
Highly Influential
3 Excerpts

and J

  • J. E. HOPCROF
  • D. ULLMAN, Introduction to Automata Theory…
  • 1979
1 Excerpt

Grammar Transformations Based on Regular Décompositions of ContextFree Dérivations

  • R. Ross
  • 1978
1 Excerpt

and D

  • R. Ross, G. HOT
  • BENSON, A General Greibach-Normal-Form…
  • 1978
1 Excerpt

Nonrepetitive Séquences, Proc

  • P.A.B. PLEASANTS
  • Cambridge Philosophical Society, Vol. 68,
  • 1970
1 Excerpt

Remarks on the Work of Axel Thue on Séquences, Nordisk Matematisk Tidskrift, Vol

  • G. A. HEDLUND
  • 15,
  • 1967
1 Excerpt

Similar Papers

Loading similar papers…