Skip to main content

Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals

  • Conference paper
Developments in Language Theory (DLT 2014)

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

Included in the following conference series:

  • 488 Accesses

Abstract

We solve two open problems concerning syntactic complexity. We prove that the cardinality of the syntactic semigroup of a left ideal or a suffix-closed language with n left quotients (that is, with state complexity n) is at most n n − 1 + n − 1, and that of a two-sided ideal or a factor-closed language is at most n n − 2 + (n − 2)2n − 2 + 1. Since these bounds are known to be reachable, this settles the problems.

This work was supported by the Natural Sciences and Engineering Research Council of Canada grant No. OGP000087, and by Polish NCN grant DEC-2013/09/N/ST6/01194.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Brzozowski, J.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1/2), 71–89 (2010)

    Google Scholar 

  2. Brzozowski, J., Jirásková, G., Li, B.: Quotient complexity of ideal languages. Theoret. Comput. Sci. 470, 36–52 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brzozowski, J., Szykuła, M.: Upper bounds on syntactic complexity of left and two-sided ideals (2014), http://arxiv.org/abs/1403.2090

  4. Brzozowski, J., Ye, Y.: Syntactic complexity of ideal and closed languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 117–128. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Pin, J.E.: Syntactic semigroups. In: Handbook of Formal Languages: Word, Language, Grammar, vol. 1, pp. 679–746. Springer, New York (1997)

    Chapter  Google Scholar 

  6. Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb. 6, 221–234 (2001)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Brzozowski, J., Szykuła, M. (2014). Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09698-8_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09697-1

  • Online ISBN: 978-3-319-09698-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics