Publications
Gérard Lallement (1935–2006). Semigroup Forum. 2009;78:379-383.Edit
Infinite-vertex free profinite semigroupoids and symbolic dynamics. J. Pure Appl. Algebra. 2009;213:605-631.Edit
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] New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy .Edit
Rational codes and free profinite monoids. J. Lond. Math. Soc. (2). 2009;79:465-477.Edit
Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc.. 2009;361:1429-1461.Edit
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
Decidability and tameness in the theory of finite semigroups. Bull. Iranian Math. Soc.. 2008;34:1-22.Edit
Description and analysis of a bottom-up DFA minimization algorithm. Inform. Process. Lett.. 2008;107:52-59.Edit
Pointlike sets with respect to $\bf R$ and $\bf J$. J. Pure Appl. Algebra. 2008;212:486-499.Edit
[2008-21] Rational Codes and Free Profinite Monoids .Edit
An automata-theoretic approach to the word problem for ω-terms over $\ssfR$. Theoret. Comput. Sci.. 2007;370:131-169.Edit
Complete reducibility of pseudovarieties. In: Semigroups and formal languages. World Sci. Publ., Hackensack, NJ; 2007. 9. p. 9-25p. Edit
Complete reducibility of systems of equations with respect to $\ssf R$. Port. Math. (N.S.). 2007;64:445-508.Edit
[2006-19] Complete reducibility of pseudovarieties .Edit