Skip to main content
SpringerLink
Log in
Book cover

International Computer Science Symposium in Russia

CSR 2017: Computer Science – Theory and Applications pp 25–37Cite as

Concatenation Hierarchies: New Bottle, Old Wine

  • Conference paper
  • First Online:

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

Abstract

We survey progress made in the understanding of concatenation hierarchies of regular languages during the last decades. This paper is an extended abstract meant to serve as a precursor of a forthcoming long version.

Funded by the DeLTA project (ANR-16-CE40-0007).

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    In fact, the original formulation of Pin and Straubing considers level 2 in the Straubing-Thérien hierarchy and not level \(\frac{3}{2}\).

References

  1. Arfi, M.: Polynomial operations on rational languages. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol. 247, pp. 198–206. Springer, Heidelberg (1987). doi:10.1007/BFb0039607

    Chapter  Google Scholar 

  2. Arfi, M.: Opérations Polynomiales et Hiérarchies de Concaténation. Theoret. Comput. Sci. 91(1), 71–84 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bojanczyk, M.: Star height via games. In: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE Computer Society 2015, pp. 214–219 (2015)

    Google Scholar 

  4. Brzozowski, J.A.: Developments in the Theory of regular Languages. In: IFIP Congress, pp. 29–40 (1980)

    Google Scholar 

  5. Brzozowski, J.A., Cohen, R.S.: Dot-depth of star-free events. J. Comput. Syst. Sci. 5(1), 1–16 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brzozowski, J.A., Knast, R.: The Dot-depth hierarchy of star-free languages is infinite. J. Comput. Syst. Sci. 16(1), 37–55 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dejean, F., Schützenberger, M.P.: On a question of Eggan. Inf. Control 9(1), 23–25 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  8. Eggan, L.C.: Transition graphs and the star-height of regular events. Michigan Math. J. 10(4), 385–397 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  9. Glaßer, C., Schmitz, H.: Languages of dot-depth 3/2. Theory Comput. Syst. 42(2), 256–286 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hashiguchi, K.: Algorithms for determining relative star height and star height. Inf. Comput. 78(2), 124–169 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kirsten, D.: Distance desert automata and the star height problem. RAIRO-Theor. Inf. Appl. 39(3), 455–509 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Annals of Mathematics Studies 34, pp. 3–41. Princeton University Press, New Jersey (1956)

    Google Scholar 

  13. Knast, R.: A semigroup characterization of dot-depth one languages. RAIRO - Theor. Inform. Appl. 17(4), 321–330 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  14. Margolis, S.W., Pin, J.E.: Products of group languages. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 285–299. Springer, Heidelberg (1985). doi:10.1007/BFb0028813

    Chapter  Google Scholar 

  15. McNaughton, R., Papert, S.A.: Counter-Free Automata. MIT Press, Cambridge (1971)

    MATH  Google Scholar 

  16. Perrin, D., Pin, J.É.: First-order logic and star-free sets. J. Comput. Syst. Sci. 32(3), 393–406 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Pin, J.É.: An explicit formula for the intersection of two polynomials of regular languages. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 31–45. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38771-5_5

    Chapter  Google Scholar 

  18. Pin, J.-É.: Open problems about regular languages, 35 years later. In: The Role of Theory in Computer Science. Essays Dedicated to Janusz Brzozowski. World Scientific (2017)

    Google Scholar 

  19. Pin, J.-É.: The dot-depth hierarchy, 45 years later. In: The Role of Theory in Computer Science. Essays Dedicated to Janusz Brzozowski. World Scientific (2017)

    Google Scholar 

  20. Pin, J.-É., Straubing, H.: Monoids of upper triangular boolean matrices. In: Semigroups. Structure and Universal Algebraic Problems, vol. 39, pp. 259–272. North-Holland (1985)

    Google Scholar 

  21. Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. In: Fülöp, Z., Gécseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 348–359. Springer, Heidelberg (1995). doi:10.1007/3-540-60084-1_87

    Chapter  Google Scholar 

  22. Pin, J.É., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Syst. 30(4), 383–422 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  23. Pin, J.É., Weil, P.: The wreath product principle for ordered semigroups. Commun. Algebra 30(12), 5677–5713 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  24. Place, T.: Separating regular languages with two quantifier alternations. In: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, pp. 202–213 (2015)

    Google Scholar 

  25. Place, T., Zeitoun, M.: Going higher in the first-order quantifier alternation hierarchy on words. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 342–353. Springer, Heidelberg (2014). doi:10.1007/978-3-662-43951-7_29

    Google Scholar 

  26. Place, T., Zeitoun, M.: Separation and the successor relation. In: 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015. Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 662–675 (2015)

    Google Scholar 

  27. Place, T., Zeitoun, M.: The tale of the quantifier alternation hierarchy of first-order logic over words. SIGLOG news 2(3), 4–17 (2015)

    Google Scholar 

  28. Place, T., Zeitoun, M.: The covering problem: a unified approach for investigating the expressive power of logics. In: Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, pp. 77:1–77:15 (2016)

    Google Scholar 

  29. Place, T., Zeitoun, M.: Separation for dot-depth two. In: 32th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017 (2017)

    Google Scholar 

  30. Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190–194 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  31. Simon, I.: Hierarchies of Events of Dot-Depth One. Ph.D. thesis. Waterloo, Ontario, Canada: University of Waterloo, Department of Applied Analysis and Computer Science (1972)

    Google Scholar 

  32. Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975). doi:10.1007/3-540-07407-4_23

    Chapter  Google Scholar 

  33. Straubing, H.: A generalization of the schützenberger product of finite monoids. Theoret. Comput. Sci. 13(2), 137–150 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  34. Straubing, H.: Finite semigroup varieties of the form V * D. J. Pure Appl. Algebra 36, 53–94 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  35. Thérien, D.: Classification of finite monoids: the language approach. Theoret. Comput. Sci. 14(2), 195–208 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  36. Thomas, W.: Classifying regular events in symbolic logic. J. Comput. Syst. Sci. 25(3), 360–376 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  37. Weil, P.: Concatenation product: a survey. In: Pin, J.E. (ed.) LITP 1988. LNCS, vol. 386, pp. 120–137. Springer, Heidelberg (1989). doi:10.1007/BFb0013116

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Bordeaux University, Bordeaux, France

    Thomas Place & Marc Zeitoun

Authors
  1. Thomas Place
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Zeitoun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Thomas Place or Marc Zeitoun .

Editor information

Editors and Affiliations

  1. University of Bordeaux , Talence, France

    Pascal Weil

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Place, T., Zeitoun, M. (2017). Concatenation Hierarchies: New Bottle, Old Wine. In: Weil, P. (eds) Computer Science – Theory and Applications. CSR 2017. Lecture Notes in Computer Science(), vol 10304. Springer, Cham. https://doi.org/10.1007/978-3-319-58747-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-58747-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-58746-2

  • Online ISBN: 978-3-319-58747-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation