Publications
Complex order biped rhythms. International Journal of Bifurcation and Chaos. 2011;21:3053-3061.Edit
A latency fractional order model for HIV dynamics. J. Comput. Appl. Math.. 2017;312:240-256.Edit
Double power laws, fractals and self-similarity. Applied Mathematical Modelling. 2014;38:4019-4026.Edit
Assessing paternities with inconclusive STR results: The suitability of bi-allelic markers. Forensic Science International: Genetics. 2013;7:16-21.Edit
Density of first Poincaré returns, periodic orbits, and Kolmogorov-Sinai entropy. Commun. Nonlinear Sci. Numer. Simul.. 2011;16:863-875.Edit
General derivation of the sets of pedigrees with the Same Kinship coefficients. Human Heredity. 2010;70:194-204.Edit
Numerical simulations in two CPG models for bipedal locomotion. J. Vib. Control. 2007;13:1487-1503.Edit
Strange patterns in one ring of Chen oscillators coupled to a `buffer' cell. Journal of Vibration and Control. 2016;22(4):3267-3295.Edit
Strange Dynamics in a Fractional Derivative of Complex-Order Network of Chaotic Oscillators. International Journal of Bifurcation and Chaos. 2015;25:15550003.Edit
A general approach to power calculation for relationship testing. Forensic Science International: Genetics. 2014;9:186-190.Edit
Estimating coancestry from genotypes using a linear regression method. Forensic Science International: Genetics Supplement Series. 2011;3.Edit
X Chromosome. In: Handbook of Forensic Genetics.; Submitted. 1. p. 193-215p. Edit
Complex order van der Pol oscillator. Nonlinear Dynam.. 2011;65:247-254.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