Advertisement

Separating words by occurrences of subwords

  • M. N. VyalyiEmail author
  • R. A. Gimadeev
Article

Abstract

We obtain some lower bounds for the complexity of word separation by occurrences of subwords. In the case of length 1 subwords, we show that the bound is exact up to a constant factor. Connection with the problem of separating words by automata is considered.

Keywords

subword word separation cyclotomic polynomial automaton 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. K. Leont’ev and M. R. Khoshmand Asl, “Characterization of BinaryWords by Subwords,” Diskretn. Anal. Issled. Oper. Ser. 1, 13(1), 65–76 (2006).zbMATHMathSciNetGoogle Scholar
  2. 2.
    K. Chandrasekharan, Introduction to Analytic Number Theory (Springer, New York, 1968; Mir, Moscow, 1974).CrossRefzbMATHGoogle Scholar
  3. 3.
    E. D. Demaine, S. Eisenstat, J. Shallit, and D. A. Wilson, “Remarks on SeparatingWords,” in Lecture Notes in Computer Science, Vol. 6808: Descriptional Complexity of Formal Systems(2011), pp. 147–157.Google Scholar
  4. 4.
    J. Karhumaki, S. Puzynina, and A. Saarela, “Fine and Wilf’s Theorem for k-Abelian Periods,” in Lecture Notes in Computer Science, Vol. 7410: Developments in Language Theory(2012), pp. 296–307.Google Scholar
  5. 5.
    J.M. Robson, “Separating Strings with Small Automata,” Inform. Process. Lett. 30, 209–214 (1989).CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    J.M. Robson, “Separating Words with Machines and Groups,” Inform. Theor. Appl. 30, 81–86 (1996).zbMATHMathSciNetGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  1. 1.Dorodnitsyn Computing CenterMoscowRussia
  2. 2.Moscow Institute of Physics and TechnologyDolgoprudnyiRussia

Personalised recommendations