Skip to main content
Springer Nature Link
Log in

Regular Varieties of Automata and Coequations

  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9129))

Included in the following conference series:

Abstract

In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Llópez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata satisfying sets of coequations called varieties of languages. We show how our results are related to Birkhoff’s theorem for regular varieties.

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

Access this chapter

Log in via an institution

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

Similar content being viewed by others

References

  1. Abel, A., Pientka, B., Thibodeau, D., Setzer, A.: Copatterns: programming infinite structures by observations. In: Giacobazzi, R., Cousot, R. (eds.) Proceedings of the 40th Annual ACM Symposium on Principles of Programming Languages (POPL ’13), pp. 27–38, ACM (2013)

    Google Scholar 

  2. Adámek, J., Milius, S., Myers, R.S.R., Urbat, H.: Generalized Eilenberg theorem I: local varieties of languages. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol. 8412, pp. 366–380. Springer, Heidelberg (2014)

    Chapter  MATH  Google Scholar 

  3. Awodey, S., Hughes, J.: Modal operators and the formal dual of Birkhoff’s completeness theorem. Math. Struct. Comput. Sci. 13(2), 233–258 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ballester-Bolinches, A., Cosme-Llópez, E., Rutten, J.J.M.M.: The dual equivalence of equations and coequations for automata. CWI Technical Report report FM-1403, pp. 1–30 (2014)

    Google Scholar 

  5. Birkhoff, G.: On the structure of abstract algebras. Proc Camb. Philos. Soc. 31, 433–454 (1935)

    Article  MATH  Google Scholar 

  6. Bonchi, F., Bonsangue, M., Hansen, H., Panangaden, P., Rutten, J., Silva, A.: Algebra-coalgebra duality in Brzozowski’s minimization algorithm. ACM Trans. Comput. Logic 15(1), 1–27 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  7. Burris, S.N., Sankappanavar, H.P.: A Course in Universal Algebra, Graduate Texts in Mathematics. Springer, New York (1981)

    MATH  Google Scholar 

  8. Clouston, R., Goldblatt, R.: Covarieties of coalgebras: comonads and coequations. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 288–302. Springer, Heidelberg (2005)

    Chapter  MATH  Google Scholar 

  9. Gehrke, M., Grigorieff, S., Pin, J.É.: Duality and equational theory of regular languages. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246–257. Springer, Heidelberg (2008)

    Chapter  MATH  Google Scholar 

  10. Graczyńska, E.: Birkhoff’s theorems for regular varieties. Bull. Sect. Logic, Univ. Łódź 26(4), 210–219 (1997)

    MathSciNet  MATH  Google Scholar 

  11. Płonka, J.: On a method of construction of abstract algebras. Fund. Math. 61, 183–189 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  12. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3–80 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Taylor, W.: Equational logic. Houston J. Math. 5, 1–83 (1979)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The research of Julian Salamanca is funded by NWO project 612.001.210. The research of Adolfo Ballester-Bolinches has been supported by the grant 11271085 from the National Natural Science Foundation of China. The research of Enric Cosme-Llópez has been supported by the predoctoral grant AP2010-2764 from the Ministerio de Educación (Spanish Government) and by an internship from CWI. The research of Adolfo Ballester-Bolinches, Enric Cosme-Llópez, and Jan Rutten has been supported by the grant MTM2014-54707-C3-1-P from the Ministerio de Economía y Competitividad (Spanish Government).

Author information

Authors and Affiliations

  1. CWI Amsterdam, Amsterdam, The Netherlands

    J. Salamanca, M. M. Bonsangue & J. J. M. M. Rutten

  2. Universitat de València, Valencia, Spain

    A. Ballester-Bolinches & E. Cosme-Llópez

  3. LIACS - Leiden University, Leiden, The Netherlands

    M. M. Bonsangue

  4. Radboud University Nijmegen, Nijmegen, The Netherlands

    J. J. M. M. Rutten

Authors
  1. J. Salamanca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Ballester-Bolinches
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. M. Bonsangue
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. E. Cosme-Llópez
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. J. M. M. Rutten
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Salamanca .

Editor information

Editors and Affiliations

  1. University of Oxford, Oxford, UK

    Ralf Hinze

  2. University of Bonn, Bonn, Germany

    Janis Voigtländer

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Salamanca, J., Ballester-Bolinches, A., Bonsangue, M.M., Cosme-Llópez, E., Rutten, J.J.M.M. (2015). Regular Varieties of Automata and Coequations. In: Hinze, R., Voigtländer, J. (eds) Mathematics of Program Construction. MPC 2015. Lecture Notes in Computer Science(), vol 9129. Springer, Cham. https://doi.org/10.1007/978-3-319-19797-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19797-5_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19796-8

  • Online ISBN: 978-3-319-19797-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics