Publications
Alphabetical satisfiability problem for trace equations. Acta Cybernetica. 2009;19(2):479-497.Edit
Amalgams of finite inverse semigroups and deterministic context-free languages. Semigroup Forum. 2012;85(1):129-146.Edit
Amalgams of finite inverse semigroups and deterministic context-free languages. Semigroup Forum. 2012;85(1):129-146.Edit
Amalgams of inverse semigroups and reversible two-counter machines. J. Pure Appl. Algebra. 2013;217:585-597.
Amalgams of inverse semigroups and reversible two-counter machines. Journal of Pure and Applied Algebra. 2013;217(4):585-597.
Amalgams vs Yamamura’s HNN-extensions of inverse semigroups. Algebra Colloquium. 2011;18(4):647-657.Edit
Bicyclic subsemigroups in amalgams of finite inverse semigroups. International Journal of Algebra and Computation. 2010;20(1):89-113.
Decidability of the word problem in Yamamura’s HNN extensions of finite inverse semigroups. Semigroup Forum. 2008;77:163-186.Edit
Fixed points of Endomorphisms of Graph Groups. Journal of Group Theory. 2013;16(4):573-583.
Fixed points of endomorphisms of graph groups. J. Group Theory. 2013;16:573-583.Edit
Fixed points of endomorphisms of trace monoids. Semigroup Forum. 2014;89:266-279.
A geometric approach to (semi)-groups defined by automata via dual transducers. Geometriae Dedicata. In Press.Edit
Groups and Semigroups Defined by Colorings of Synchronizing Automata. International Journal of Algebra and Computation. In Press.Edit
Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.
Maximal subgroups of amalgams of finite inverse semigroups. Semigroup Forum. In Press.Edit
Multilinear equations in amalgams of finite inverse semigroups. International Journal of Algebra and Computation. 2011;21(1-2):35-59.Edit
On periodic points of free inverse monoid endomorphisms. Internat. J. Algebra Comput.. 2013;23:1789-1804.
On periodic points of free inverse monoid endomorphisms. International Journal of Algebra and Computation. 2013;23(8):1789-1803.
Semisimple synchronizing automata and the Wedderburn-Artin theory. Internat. J. Foundat. Comput. Sci.. 2016;27(2):127-145.Edit
State complexity for code operators. International Journal of Foundations of Computer Science. 2011;22(7):1669-1681.Edit
Synchronizing automata with finitely many minimal synchronizing words. Information and Computation. 2011;209(3):568-579.Edit
[2012-32] Fixed points of endomorphisms of trace monoids .