Publicaciones (18) Publicaciones de ENRIC COSME LLOPEZ

2023

  1. Functoriality of the Schmidt construction

    Logic Journal of the IGPL, Vol. 31, Núm. 5, pp. 822-893

2022

  1. A comic page for the first isomorphism theorem

    Journal of Mathematics and the Arts, Vol. 16, Núm. 1-2, pp. 29-56

2021

  1. InnoCOVID-19: Primer congreso multidisciplinar Innocampus

    In-Red 2021. VII Congreso nacional de innovación educativa y docencia en red: lecciones aprendidas, ideas compartidas

2020

  1. Congruence-based proofs of the recognizability theorems for free many-sorted algebras

    Journal of Logic and Computation, Vol. 30, Núm. 2, pp. 561-633

  2. Innocampus Explora: una aproximación multidisciplinar a la problemática ambiental

    In-Red 2020. VI Congreso nacional de innovación educativa y docencia en red

2019

  1. A characterization of the n-ary many-sorted closure operators and a many-sorted Tarski irredundant basis theorem

    Quaestiones Mathematicae, Vol. 42, Núm. 10, pp. 1427-1444

  2. Some contributions to the theory of transformation monoids

    Journal of Algebra, Vol. 522, pp. 31-60

  3. Validation of a inertial movement unit with a linear encoder to evaluate strength and power

    European Journal of Human Movement, Núm. 43, pp. 40-48

2018

  1. When are profinite many-sorted algebras retracts of ultraproducts of finite many-sorted algebras?

    Logic Journal of the IGPL, Vol. 26, Núm. 4, pp. 381-407

2017

  1. K4-free graphs as a free algebra

    Leibniz International Proceedings in Informatics, LIPIcs

  2. On subgroup functors of finite soluble groups

    Science China Mathematics, Vol. 60, Núm. 3, pp. 439-448

2016

  1. Group extensions and graphs

    Expositiones Mathematicae, Vol. 34, Núm. 3, pp. 327-334

2015

  1. Formations of monoids, congruences, and formal languages

    Scientific Annals of Computer Science, Vol. 25, Núm. 2, pp. 171-209

  2. Regular varieties of automata and coequations

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. The dual equivalence of equations and coequations for automata

    Information and Computation, Vol. 244, pp. 49-75

2014

  1. A description based on languages of the final non-deterministic automaton

    Theoretical Computer Science, Vol. 536, pp. 1-20

2013

  1. Algorithms for permutability in finite groups

    Central European Journal of Mathematics, Vol. 11, Núm. 11, pp. 1914-1922

  2. Varieties and covarieties of languages (extended abstract)

    Electronic Notes in Theoretical Computer Science