Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2017: Fundamentals of Computation Theory pp 34–37Cite as

Some Results of Zoltán Ésik on Regular Languages

  • Conference paper
  • First Online:

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

Abstract

Zoltán Ésik published 2 books as an author, 32 books as editor and over 250 scientific papers in journals, chapters and conferences. It was of course impossible to survey such an impressive list of results and in this lecture, I will only focus on a very small portion of Zoltán’s scientific work. The first topic will be a result from 1998, obtained by Zoltán jointly with Imre Simon, in which he solved a twenty year old conjecture on the shuffle operation. The second topic will be his algebraic study of various fragments of logic on words. Finally I will briefly describe some results on commutative languages obtained by Zoltán, Jorge Almeida and myself.

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

References

  1. Almeida, J., Cano, A., Klíma, O., Pin, J.-É.: Fixed points of the lower set operator. Int. J. Algebra Comput. 25(1–2), 259–292 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Almeida, J., Ésik, Z., Pin, J.-É.: Commutative positive varieties of languages. Acta Cybern. 23, 91–111 (2017)

    Article  Google Scholar 

  3. Bloom, S.L., Ésik, Z.: Free shuffle algebras in language varieties extended abstract. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds.) LATIN 1995. LNCS, vol. 911, pp. 99–111. Springer, Heidelberg (1995). doi:10.1007/3-540-59175-3_84

    Chapter  Google Scholar 

  4. Bloom, S.L., Ésik, Z.: Nonfinite axiomatizability of shuffle inequalities. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds.) CAAP 1995. LNCS, vol. 915, pp. 318–333. Springer, Heidelberg (1995). doi:10.1007/3-540-59293-8_204

    Chapter  Google Scholar 

  5. Bloom, S.L., Ésik, Z.: Free shuffle algebras in language varieties. Theoret. Comput. Sci. 163(1–2), 55–98 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic Press, New York (1976)

    MATH  Google Scholar 

  7. Ésik, Z.: Extended temporal logic on finite words and wreath product of monoids with distinguished generators. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 43–58. Springer, Heidelberg (2003). doi:10.1007/3-540-45005-X_4

    Chapter  Google Scholar 

  8. Ésik, Z., Bertol, M.: Nonfinite axiomatizability of the equational theory of shuffle. In: Fülöp, Z., Gécseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 27–38. Springer, Heidelberg (1995). doi:10.1007/3-540-60084-1_60

    Chapter  Google Scholar 

  9. Ésik, Z., Bertol, M.: Nonfinite axiomatizability of the equational theory of shuffle. Acta Inform. 35(6), 505–539 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ésik, Z., Ito, M.: Temporal logic with cyclic counting and the degree of aperiodicity of finite automata. Acta Cybern. 16, 1–28 (2003)

    MathSciNet  MATH  Google Scholar 

  11. Ésik, Z., Simon, I.: Modeling literal morphisms by shuffle. Semigroup Forum 56, 225–227 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Perrot, J.-F.: Variétés de langages et operations. Theoret. Comput. Sci. 7, 197–210 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pin, J.-E.: A variety theorem without complementation. Russ. Math. (Iz. VUZ) 39, 80–90 (1995)

    Google Scholar 

  14. Straubing, H.: On logical descriptions of regular languages. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 528–538. Springer, Heidelberg (2002). doi:10.1007/3-540-45995-2_46

    Chapter  Google Scholar 

  15. Wolper, P.: Temporal logic can be more expressive. Inform. Control 56(1–2), 72–99 (1983)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIF, CNRS, Paris, France

    Jean-Éric Pin

Authors
  1. Jean-Éric Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Éric Pin .

Editor information

Editors and Affiliations

  1. CNRS, University of Bordeaux, Talence cedex, France

    Ralf Klasing

  2. LaBRI, University of Bordeaux, Talence cedex, France

    Marc Zeitoun

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag GmbH Germany

About this paper

Cite this paper

Pin, JÉ. (2017). Some Results of Zoltán Ésik on Regular Languages. In: Klasing, R., Zeitoun, M. (eds) Fundamentals of Computation Theory. FCT 2017. Lecture Notes in Computer Science(), vol 10472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55751-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-55751-8_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-55750-1

  • Online ISBN: 978-3-662-55751-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation