[2008-21] Almeida J, Steinberg B. Rational Codes and Free Profinite Monoids .Edit

Almeida J, Steinberg B. On the decidability of iterated semidirect products with applications to complexity. Proc. London Math. Soc. (3). 2000;80:50-74.Edit

[2007-34] Almeida J. Decidability and tameness in the theory of finite semigroups .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

[2006-20] Almeida J, Margolis SW, Steinberg B, Volkov M. Representation theory of finite semigroups, semigroup radicals and formal language theory .Edit

Almeida J, Zeitoun M. The pseudovariety $\bf J$ is hyperdecidable. RAIRO Inform. Théor. Appl.. 1997;31:457-482.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

[2015-33] Almeida J, Costa JC, Zeitoun M. Factoriality and the Pin-Reutenauer procedure .Edit

[2012-26] Almeida J, Cardoso Â. A Sequence of Weakly Monotonic Automata with Increasing Level .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, Klíma O. On the irreducibility of pseudovarieties of semigroups. Journal of Pure and Applied Algebra. 2016;220(4):1517-1524.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. Some quasi-ordered classes of finite commutative semigroups. Semigroup Forum. 1985;32:189-200.Edit

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

[2016-2] Almeida J, Klíma O, Kunc M.. The omega-inequality problem for concatenation hierarchies of star-free languages .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

Almeida J, Klíma O. Reducibility vs. definability for pseudovarieties of semigroups. International Journal of Algebra and Computation. 2016;26(7):1483-1495.Edit

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

[2009-14] Almeida J, Costa JC, Zeitoun M. Some structural properties of the free profinite aperiodic semigroup .Edit

Almeida J, Silva PV. SC-hyperdecidability of $\bf R$. Theoret. Comput. Sci.. 2001;255:569-591.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