Publications
Biped robots: effects of small perturbations on the generation of modular trajectories. JNAIAM. J. Numer. Anal. Ind. Appl. Math.. 2012;7:27-37.Edit
The Karimojong from Uganda: Genetic characterization using an X-STR decaplex system. Forensic Science International: Genetics. 2009;3.Edit
Mathematical model for HIV dynamics in HIV-specific helper cells. Commun. Nonlinear Sci. Numer. Simul.. 2014;19:693-701.Edit
Assessing the potential application of X-chromosomal haploblocks in population genetics and forensic studies. Forensic Science International: Genetics Supplement Series. 2013;4.Edit
Complex-order forced van der Pol oscillator. J. Vib. Control. 2012;18:2201-2209.Edit
Fractional central pattern generators for bipedal locomotion. Nonlinear Dynam.. 2010;62:27-37.Edit
How useful is your X in discerning pedigrees? Forensic Science International: Genetics Supplement Series. 2011;3.Edit
The role of synaptic transmission in a HIV model with memory. Appl. Math. Comput.. 2017;292:76-95.Edit
Formulation and communication of evaluative forensic science expert opinion—A GHEP-ISFG contribution to the establishment of standards. Forensic Science International: Genetics. 2016;25:210-213.Edit
Fractional Dynamics of Computer Virus Propagation. Mathematical Problems in Engineering. 2014;2014:7.Edit
Comparative evaluation of alternative batteries of genetic markers to complement autosomal STRs in kinship investigations: Autosomal indels vs. X-chromosome STRs. International Journal of Legal Medicine. 2012;126:917-921.Edit
Hexapod robots: new CPG model for generation of trajectories. JNAIAM. J. Numer. Anal. Ind. Appl. Math.. 2012;7:15-26.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
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
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