Skip to main content
SpringerLink
Log in

Abelian Primitive Words

  • Conference paper
Developments in Language Theory (DLT 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6795))

Included in the following conference series:

Abstract

We investigate Abelian primitive words, which are words that are not Abelian powers. We show the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive in linear time. Also different from classical primitive words, we find that a word may have more than one Abelian root. We also consider enumeration of Abelian primitive words.

A full version of this paper, including proofs omitted for space reasons, is available at arXiv:1006.4104v2.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, I.: On primitive sequences. Journal London Math. Soc. 42, 137–148 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  2. Anderson, I.: Combinatorics of finite sets. Dover Publications, Mineola (2002)

    MATH  Google Scholar 

  3. Bach, E., Shallit, J.: Algorithmic Number Theory, vol. 1. MIT Press, Cambridge (1997)

    MATH  Google Scholar 

  4. Berstel, J., Boasson, L.: The set of Lyndon words is not context-free. Bull. EATCS 63, 139–140 (1997)

    MathSciNet  MATH  Google Scholar 

  5. Constantinescu, S., Ilie, L.: Fine and Wilf’s theorem for Abelian periods. Bull. EATCS 89, 167–170 (2006)

    MathSciNet  MATH  Google Scholar 

  6. Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoretical Computer Science 411, 617–630 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. de Bruijn, N., van Ebbenhorst Tengbergen, C., Kruyswijk, D.: On the set of divisors of a number. Nieuw Arch. Wiskunde 23, 191–193 (1951)

    MathSciNet  MATH  Google Scholar 

  8. Dömösi, P., Horváth, S., Ito, M., Kászonyi, L., Katsura, M.: Formal languages consisting of primitive words. In: Ésik, Z. (ed.) FCT 1993. LNCS, vol. 710, pp. 194–203. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  9. Gabarró, J.: Some applications of the interchange lemma. Bull. EATCS 25, 19–21 (1985)

    Google Scholar 

  10. Hardy, G., Wright, E.: An Introduction to the Theory of Numbers, 5th edn. Oxford Science Publications, Oxford (2000)

    Google Scholar 

  11. Lothaire, M.: Combinatorics on words. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  12. Petersen, H.: The ambiguity of primitive words. In: Enjalbert, P., Mayr, E., Wagner, K. (eds.) STACS 1994. LNCS, vol. 775, pp. 679–690. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  13. Richmond, L.B., Shallit, J.: Counting Abelian squares. Elec. J. Combinatorics 16, R72 (2009)

    MathSciNet  MATH  Google Scholar 

  14. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1. Springer, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2N2, Canada

    Michael Domaratzki

  2. Department of Mathematics, University of Liège, 4000, Liège, Belgium

    Narad Rampersad

Authors
  1. Michael Domaratzki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Narad Rampersad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy

    Giancarlo Mauri  & Alberto Leporati  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Domaratzki, M., Rampersad, N. (2011). Abelian Primitive Words. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22321-1_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22320-4

  • Online ISBN: 978-3-642-22321-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation