Skip to main content
SpringerLink
Log in

Factorial Languages of Low Combinatorial Complexity

  • Conference paper
Developments in Language Theory (DLT 2006)

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

Included in the following conference series:

Abstract

The complexity (or growth) functions of some languages are studied over arbitrary nontrivial alphabets. The attention is focused on the languages determined by a finite set of forbidden factors, called an antidictionary. Let m be a nonnegative integer. Examples of languages of complexity Θ(n m) with finite (and even symmetric finite) antidictionaries are given. For any integer s such that 1≤s ≤m, a sequence of languages with finite antidictionaries and Θ(n m) complexities, converging to the language of Θ(n s) complexity, is exhibited. Some languages of intermediate complexity are shown to be the limits of sequences of languages with finite antidictionaries and polynomial complexities.

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. Balogh, J., Bollobas, B.: Hereditary properties of words. RAIRO – Inf. Theor. Appl. 39, 49–65 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brandenburg, F.-J.: Uniformly growing k-th power free homomorphisms. Theor. Comput. Sci. 23, 69–82 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  3. Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rosenberg, G., Salomaa, A. (eds.) Handbook of formal languages, ch. 6, vol. 1, pp. 329–438. Springer, Berlin (1997)

    Google Scholar 

  4. Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inform. Processing Letters 67(3), 111–117 (1998)

    Article  MathSciNet  Google Scholar 

  5. Kobayashi, Y.: Repetition-free words. Theor. Comp. Sci. 44, 175–197 (1986)

    Article  MATH  Google Scholar 

  6. Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)

    MATH  Google Scholar 

  7. Shur, A.M.: Combinatorial complexity of rational languages (Russian). Discr. Anal. and Oper. Research, Ser. 1, 12(2), 78–99 (2005)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural State University, Ekaterinburg, Russia

    Arseny M. Shur

Authors
  1. Arseny M. Shur
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, WA 99164, Pullman, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shur, A.M. (2006). Factorial Languages of Low Combinatorial Complexity. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_36

Download citation

  • DOI: https://doi.org/10.1007/11779148_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

  • Online ISBN: 978-3-540-35430-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation