Almeida J, Rodaro E. Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. In: Development in Language Theory, DLT 2014. Vol LNCS, 8633.; 2014. 4. p. 49-60p. Edit

Almeida J, Zeitoun M. The pseudovariety $\bf J$ is hyperdecidable. RAIRO Inform. Théor. Appl.. 1997;31:457-482.Edit

Almeida J. On power varieties of semigroups. J. Algebra. 1989;120:1-17.Edit

Almeida J, Costa JC, Zeitoun M. Tameness of pseudovariety joins involving R. Monatsh. Math.. 2005;146:89-111.Edit

[2015-34] Almeida J, Klíma O. Representations of relatively free profinite semigroups, irreducibility, and order primitivity .Edit

[2009-29] Almeida J, Margolis SW, Steinberg B, Volkov M. Characterization of group radicals with an application to Mal'cev products .Edit

[2009-39] Almeida J, Klíma O. New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy .Edit

Almeida J, Weil P. Reduced factorizations in free profinite groups and join decompositions of pseudovarieties. Internat. J. Algebra Comput.. 1994;4:375-403.Edit

[2009-3] Almeida J, Costa JC, Zeitoun M. Iterated periodicity over finite aperiodic semigroups .Edit

Almeida J, Couceiro M, Waldhauser T. On the topological semigroup of equational classes of finite functions under composition. J. of Mult.-Valued Logic & Soft Computing. 2017;28(1):5-28.Edit

[2007-18] Almeida J, Volkov M, Goldberg S.. Complexity of the identity checking problem for finite semigroups .Edit

Almeida J, Costa JC, Zeitoun M. McCammond's normal forms for free aperiodic semigroups revisited. LMS J. Comput. Math.. 2015;18:130-147.Edit

[2005-41] Almeida J. Engel elements in groups and dynamical systems defining nilpotency in finite groups .Edit

Almeida J. Dynamics of finite semigroups. In: Semigroups, algorithms, automata and languages (Coimbra, 2001). World Sci. Publ., River Edge, NJ; 2002. 2. p. 269-292p. Edit

Almeida M, Moreira N, Reis R. Finite automata minimization algorithms. Wang J, editor Chapman and Hall/CRC Press 2012.Edit

Almeida J, Higgins PM, Volkov M. An addendum: ``The gap between partial and full'' [Internat. J. Algebra Comput. \bf 8 (1998), no. 3, 399–430; MR1627844 (99g:20102)]. Internat. J. Algebra Comput.. 2001;11:131-135.Edit

[2010-1] Almeida J. Presentations of Schutzenberger groups of minimal subshifts .Edit

[2006-39] Almeida J, Zeitoun M. A bottom-up minimization DFA algorithm and applications .Edit

Almeida J. Recent developments in the theory of implicit operations. In: Monoids and semigroups with applications (Berkeley, CA, 1989). World Sci. Publ., River Edge, NJ; 1991. 1. p. 105-117p. Edit

Almeida J, Perrin D. Gérard Lallement (1935–2006). Semigroup Forum. 2009;78:379-383.Edit

[2009-13] Almeida J, Steinberg B. Matrix Mortality and the Cerny-Pin Conjecture .Edit

Almeida M, Moreira N, Reis R. Incremental DFA Minimisation. In: Domaratzki M, Salomaa K, editors. Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010). Winnipeg, MA, Canada; 2011. 3. p. 39-48p. Edit

Almeida J. Some algorithmic problems for pseudovarieties. Publ. Math. Debrecen. 1999;54:531-552.Edit

[2005-26] Almeida J, Margolis SW, Steinberg B, Volkov M. Modular and threshold subword counting and matrix representations of finite monoids .Edit

Almeida J. Equations for pseudovarieties. In: Formal properties of finite automata and applications (Ramatuelle, 1988). Vol 386. Springer, Berlin; 1989. 1. p. 148-164p. (Lecture Notes in Comput. Sci.; vol 386).Edit