Publications
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.
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. In: Computability in Europe, CiE 2011. Vol LNCS, 6735.; 2011. 2. p. 230-238p. Edit
Regular Ideal Languages and Synchronizing Automata. In: Combinatorics on Words, WORDS 2013. Vol LNCS, 8079.; 2013. 2. p. 205-216p.
Reset Regular Decomposition Complexity of Regular Ideal Languages (extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 3. p. 30-35p.
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. In: Development in Language Theory, DLT 2014. Vol LNCS, 8633.; 2014. 4. p. 49-60p. 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
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
State complexity of prefix, suffix, bifix and infix op- erators on regular languages. Vol LNCS, 6224 2010.Edit
A stochastic continuous cellular automata traffic flow model with a multi-agent fuzzy system. In: EWGT2012 - 15th Meeting of the EURO Working Group on Transportation, September 2012, Paris. Vol Procedia - Social and Behavioral Sciences vol. 54.; 2012. p. pp. p. 1350-1359p. Edit
Synchronizing automata with finitely many minimal synchronizing words. Information and Computation. 2011;209(3):568-579.Edit