Publications
X Chromosome. In: Handbook of Forensic Genetics.; Submitted. 1. p. 193-215p. Edit
Hexapod robots: new CPG model for generation of trajectories. JNAIAM. J. Numer. Anal. Ind. Appl. Math.. 2012;7:15-26.Edit
Density of first Poincaré returns, periodic orbits, and Kolmogorov-Sinai entropy. Commun. Nonlinear Sci. Numer. Simul.. 2011;16:863-875.Edit
New findings on the dynamics of HIV and TB coinfection models. Appl. Math. Comput.. 2014;242:36-46.Edit
Paternity exclusion power: Comparative behaviour of autosomal and X-chromosomal markers in standard and deficient cases with inbreeding. Forensic Science International: Genetics. 2013;7:290-295.Edit
Identification of species by multiplex analysis of variable-length sequences. Nucleic Acids Research. 2010;38.
Exotic dynamics in networks of coupled rings of cells. International Journal of Bifurcation and Chaos. 2012;22:13.Edit
Resistive switching and activity-dependent modifications in Ni-doped graphene oxide thin films. Applied Physics Letters. 2012;101.Edit
Modelling gait transition in two-legged animals. Commun. Nonlinear Sci. Numer. Simul.. 2011;16:4625-4631.Edit
Fractional complex-order model for HIV infection with drug resistance during therapy. Journal of Vibration and Control. 2016;22(9):2222-2239.Edit
Theory and statistics of mutation rates: A mathematical framework reformulation for forensic applications. Forensic Science International: Genetics Supplement Series. 2015;5:e131-e132.Edit
Straightforward inference of ancestry and admixture proportions through ancestry-informative insertion deletion multiplexing. PLoS ONE. 2012;7.Edit
[2017-24] Stability of a heteroclinic network and its cycles: a case study from Boussinesq convection .Edit
[2017-36] A pair of rigid surfaces with p_g=q=2 and K^2=8 whose universal cover is not the bidisk .Edit
Synchronizing automata with finitely many minimal synchronizing words. Information and Computation. 2011;209(3):568-579.Edit
Finitely generated synchronizing automata. In: Language and Automata Theory and Applications, LATA 2009. Vol LNCS, 5457.; 2009. 6. p. 672-683p. 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
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