https://orcid.org/0000-0001-8059-4117
References
- Almeida, J. (1994). Finite Semigroups and Universal Algebra. Singapore: World Scientific.
- Bloom, S. L. (1976). Varieties of ordered algebras. J. Comput. Syst. Sci. 13(2):200–212. DOI: 10.1016/S0022-0000(76)80030-X.
- Colcombet, T. (2013). Regular cost functions, part I: logic and algebra over words. Log. Meth. Comput. Sci. 9(3):3. DOI: 10.2168/LMCS-9(3:3)2013.
- Colcombet, T. (2013). Fonctions régulières de coût. Habilitation à diriger les recherches, École Doctorale de Sciences Mathématiques de Paris Centre.
- Daviaud, L., Kuperberg, D., and Pin, J.-É. (2016). Varieties of Cost Functions. In N. Ollinger and H. Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Volume 47 of Leibniz International Proceedings in Informatics (LIPIcs), pages 30:1–30:14. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
- Droste, M., Kuich, W. (2009). Semirings and formal power series. In Handbook of Weighted Automata. Berlin, Heidelberg: Springer, pp. 3–28.
- Fernandes, B. H. (2018). Álgebras de estabilização [Master’s thesis]. Universidade de Lisboa, Faculdade de Ciências.
- Howie, J. M. (1995). Fundamentals of Semigroup Theory. Oxford, UK: Oxford University Press.
- Mitsch, H. (1986). A natural partial order for semigroups. Proc. Amer. Math. Soc. 97(3):384–388. DOI: 10.1090/S0002-9939-1986-0840614-0.
- Pin, J.-É. (1986). Varieties of Formal Languages. New York, NY: Plenum Publishing Co.
- Salomaa, A., Soittola, M. (2012). Automata-Theoretic Aspects of Formal Power Series. New York, NY: Springer Science & Business Media.
- Simon, I. (1990). Factorization forests of finite height. Theor. Comput. Sci. 72(1):65–94. DOI: 10.1016/0304-3975(90)90047-L.
- Urbat, H., Adámek, J., Chen, L., Milius, S. (2017). Eilenberg theorems for free. In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark, pages 43:1–43:15.