The dual equivalence of equations and coequations for automata A Ballester Bolinches, E Cosme Llópez, J Rutten Information and Computation 244, 49-75, 2015 | 23 | 2015 |
K4-free graphs as a free algebra E Cosme Llópez, D Pous 42nd International Symposium on Mathematical Foundations of Computer Science, 2017 | 19 | 2017 |
Varieties and covarieties of languages J Rutten, A Ballester Bolinches, E Cosme Llópez Electronic Notes in Theoretical Computer Science 298, 7-28, 2013 | 10 | 2013 |
Formations of monoids, congruences, and formal languages A Ballester Bolinches, E Cosme Llópez, R Esteban Romero, JJMM Rutten Scientific Annals of Computer Science 25 (2), 171-209, 2015 | 9 | 2015 |
Group extensions and graphs A Ballester Bolinches, E Cosme Llópez, R Esteban Romero Expositiones Mathematicae 34 (3), 327-334, 2016 | 7 | 2016 |
Eilenberg theorems for many-sorted formations J Climent Vidal, E Cosme Llópez arXiv preprint arXiv:1604.04792, 2016 | 6 | 2016 |
Regular varieties of automata and coequations J Salamanca, A Ballester Bolinches, MM Bonsangue, E Cosme Llópez, ... International Conference on Mathematics of Program Construction, 224-237, 2015 | 6 | 2015 |
A description based on languages of the final non-deterministic automaton A Ballester Bolinches, E Cosme Llópez, R Esteban Romero Theoretical Computer Science 536, 1-20, 2014 | 6 | 2014 |
On subgroup functors of finite soluble groups A Ballester Bolinches, E Cosme Llópez, SF Kamornikov Science China Mathematics 60, 439-448, 2017 | 4 | 2017 |
Congruence-based proofs of the recognizability theorems for free many-sorted algebras J Climent Vidal, E Cosme Llópez Journal of Logic and Computation 30 (2), 561-633, 2020 | 3 | 2020 |
Algorithms for permutability in finite groups A Ballester Bolinches, E Cosme Llópez, R Esteban Romero Open Mathematics 11 (11), 1914-1922, 2013 | 3 | 2013 |
A comic page for the first isomorphism theorem E Cosme Llópez, R Ruiz Mora, N Tamarit Journal of Mathematics and the Arts 16 (1-2), 29-56, 2022 | 2 | 2022 |
Some contributions to the algebraic theory of automata E Cosme Llópez Universitat de València, 2015 | 2 | 2015 |
Płonka Adjunction J Climent Vidal, E Cosme Llópez arXiv preprint arXiv:2305.03581, 2023 | 1* | 2023 |
Functoriality of the Schmidt construction J Climent Vidal, E Cosme Llópez Logic Journal of the IGPL 31 (5), jzac048, 2022 | 1 | 2022 |
Some contributions to the theory of transformation monoids A Ballester Bolinches, E Cosme Llópez, P Jiménez Seral Journal of Algebra 522, 31-60, 2019 | 1 | 2019 |
A characterization of the -ary many-sorted closure operators and a many-sorted Tarski irredundant basis theorem J Climent Vidal, E Cosme Llópez arXiv preprint arXiv:1710.08971, 2017 | 1 | 2017 |
Errata to" Formations of Monoids, Congruences, and Formal Languages". A Ballester Bolinches, E Cosme Llópez, R Esteban Romero, JJMM Rutten Sci. Ann. Comput. Sci. 26 (1), 123-124, 2016 | 1 | 2016 |
From higher-order rewriting systems to higher-order categorial algebras and higher-order Curry-Howard isomorphisms J Climent Vidal, E Cosme Llópez arXiv preprint arXiv:2402.12051, 2024 | | 2024 |
Lallement functor is a weak right multiadjoint J Climent Vidal, E Cosme Llópez arXiv preprint arXiv:2311.02944, 2023 | | 2023 |