[2009-17] Almeida J, Klíma O. A counterexample to some conjectures concerning concatenation hierarchies .Edit

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

[2009-41] Almeida J, Moura A. Idempotent-generated semigroups and pseudovarieties .Edit

Almeida J, Costa A. Infinite-vertex free profinite semigroupoids and symbolic dynamics. J. Pure Appl. Algebra. 2009;213:605-631.Edit

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

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

Almeida J, Steinberg B. Matrix mortality and the Černý-Pin conjecture. In: Developments in language theory. Vol 5583. Springer, Berlin; 2009. 6. p. 67-80p. (Lecture Notes in Comput. Sci.; vol 5583).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, Steinberg B. Rational codes and free profinite monoids. J. Lond. Math. Soc. (2). 2009;79:465-477.Edit

Almeida J, Margolis S, Steinberg B, Volkov M. Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc.. 2009;361:1429-1461.Edit

[2009-28] Almeida J, Costa JC, Teixeira M.. Semidirect product with an order-computable pseudovariety and tameness .Edit

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

Almeida J, Volkov M, Goldberg S.. Complexity of the identity checking problem for finite semigroups. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI). 2008;358:5-22, 301.Edit

Almeida J. Decidability and tameness in the theory of finite semigroups. Bull. Iranian Math. Soc.. 2008;34:1-22.Edit

Almeida J, Zeitoun M. Description and analysis of a bottom-up DFA minimization algorithm. Inform. Process. Lett.. 2008;107:52-59.Edit

Almeida J, Costa JC, Zeitoun M. Pointlike sets with respect to $\bf R$ and $\bf J$. J. Pure Appl. Algebra. 2008;212:486-499.Edit

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

Almeida J, Zeitoun M. An automata-theoretic approach to the word problem for ω-terms over $\ssfR$. Theoret. Comput. Sci.. 2007;370:131-169.Edit

Almeida J, Costa JC, Zeitoun M. Complete reducibility of pseudovarieties. In: Semigroups and formal languages. World Sci. Publ., Hackensack, NJ; 2007. 9. p. 9-25p. Edit

Almeida J, Costa JC, Zeitoun M. Complete reducibility of systems of equations with respect to $\ssf R$. Port. Math. (N.S.). 2007;64:445-508.Edit

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

[2007-34] Almeida J. Decidability and tameness in the theory of finite semigroups .Edit

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

[2006-19] Almeida J, Costa JC, Zeitoun M. Complete reducibility of pseudovarieties .Edit

[2006-31] Almeida J, Costa JC, Zeitoun M. Complete reducibility of systems of equations with respect to R .Edit