Publications
[2013-10] On the topological semigroup of equational classes of finite functions under composition .Edit
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. In: Development in Language Theory, DLT 2014. Vol LNCS, 8633.; 2014. 4. p. 49-60p. Edit
Tameness of the pseudovariety of abelian groups. Internat. J. Algebra Comput.. 2005;15:327-338.Edit
A sequence of weakly monotonic automata with increasing level. Int. J. Algebra. 2013;7:91-100.Edit
Semisimple synchronizing automata and the Wedderburn-Artin theory. In: Developments in Language Theory, 2014. Vol Developments in Language Theory. Russia, Ekaterinburg: Springer; 2014. 4. p. 49-60p. Edit
SC-hyperdecidability of $\bf R$. Theoret. Comput. Sci.. 2001;255:569-591.Edit
On the hyperdecidability of semidirect products of pseudovarieties. Comm. Algebra. 1998;26:4065-4077.Edit
Closures of regular languages for profinite topologies. Semigroup Forum. 2014;89:20-40.Edit
Iterated periodicity over finite aperiodic semigroups. European J. Combin.. 2014;37:115-149.Edit
On the transition semigroups of centrally labeled Rauzy graphs. Internat. J. Algebra Comput.. 2012;22:1250018, 25.Edit
Characterization of group radicals with an application to Mal\cprime cev products. Illinois J. Math.. 2010;54:199-221.Edit
New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages. Discrete Math. Theor. Comput. Sci.. 2010;12:41-58.Edit
Semidirect product with an order-computable pseudovariety and tameness. Semigroup Forum. 2010;81:26-50.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
A counterexample to a conjecture concerning concatenation hierarchies. Inform. Process. Lett.. 2009;110:4-7.Edit
Gérard Lallement (1935–2006). Semigroup Forum. 2009;78:379-383.Edit
Rational codes and free profinite monoids. J. Lond. Math. Soc. (2). 2009;79:465-477.Edit
Infinite-vertex free profinite semigroupoids and symbolic dynamics. J. Pure Appl. Algebra. 2009;213:605-631.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