Skip to main content
SpringerLink
Log in

On uniform DOL words

  • Automata and Formal Languages III
  • Conference paper
  • First Online:
STACS 98 (STACS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1373))

Included in the following conference series:

Abstract

We introduce the wide class of marked uniform DOL words and study their structure. The criterium of circularity of a marked uniform DOL word is given, and the subword complexity function is found for the uncircular case as well as for the circular one.

The same technique is valid for a wider class of uniform DOL sequences which includes (p, 1)-Toeplitz words (see [4]).

Supported in part by the Russian Foundation for Basic Research (Grant 96-01-01800) and Federal Aim Program “Integration” (Grant 473)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avgustinovich S. V.: The number of distinct subwords of fixed length in the Morse-Hedlund sequence. Sibirsk. zhurnal issledovaniya operatsii. 1 no. 2 (1994) 3–7

    Google Scholar 

  2. Brlec, S.: Enumeration of factors in the Thue-Morse word. Diskr. Appl. Math. 24 (1989) 83–96

    Article  Google Scholar 

  3. Cassaigne, J.: An algorithm to test if a given circular HDOL-language avoids a pattern. IFIP World Computer Congress'94. Elsevier (North-Holland) 1 (1994) 459–464

    Google Scholar 

  4. Cassaigne, J., Karhumäki, J.: Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms. COCOON'95, Lect. Notes Comp. Sci., no. 959 (1995)

    Google Scholar 

  5. Frid, A.: On the subword complexity of symbolic sequences generated by morphisms. Diskretnyi analiz i issledovaniye operatsii 4 no.1 (1997) 53–59 (in Russian)

    MathSciNet  MATH  Google Scholar 

  6. Frid, A.: The Subword Complexity of Fixed Points of Binary Uniform Morphisms. FCT'97, Lect. Notes Comp. Sci., no. 1279 (1997) 178–187

    Google Scholar 

  7. Keränen, V.: Abelian Squares are Avoidable on 4 Letters. ICALP'92, Lect. Notes Comp. Sci., no. 623 (1992)

    Google Scholar 

  8. de Luca, A., Varriccio, S.: Some combinatorial properties of the Thue-Morse sequence and a problem of semi groups. Theoret. Comp. Sci. 63 (1989) 333–348

    Article  MATH  Google Scholar 

  9. Mignosi, F., Séébold, P.: If a DOL language is k-power-free then it is circular. ICALP'93, Lect. Notes Comp. Sci., no. 700 (1993)

    Google Scholar 

  10. Mossé, B.: Puissances de mots et reconnaissabilité des points fixes d'une substitution. Theoret. Comp. Sci. 99 (1992) 327–334

    Article  MathSciNet  MATH  Google Scholar 

  11. Mossé, B.: Reconnaissabilité des substitutions et complexité des suites automatiques. Bulletin de la Société Mathématique de France 124 (1996) 329–346

    MATH  Google Scholar 

  12. Tapsoba, T.: Automates calculant la complexité des suites automatiques. Journal de Théorie des nombres de Bordeaux 6 (1994) 127–134

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, 2, Pirogova st., 630090, Novosibirsk, Russia

    Anna E. Frid

Authors
  1. Anna E. Frid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Frid, A.E. (1998). On uniform DOL words. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028589

Download citation

  • DOI: https://doi.org/10.1007/BFb0028589

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64230-5

  • Online ISBN: 978-3-540-69705-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation