Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering Computer Science and Information Technologies
Rajesh Kumar
Chhaju Ram Memorial Jat College
Computer Science & IT Electrical & Electronics Engineering Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Optimizing requirement analysis by the use of meta-heuristic in search based software engineering Rajesh Kumar; Rakesh Kumar
International Journal of Electrical and Computer Engineering (IJECE) Vol 9, No 5: October 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (756.035 KB) | DOI: 10.11591/ijece.v9i5.pp4336-4343

Abstract

Requirements analysis is the first phase of software development process and it is one of the main concerns of software engineers. The selection of requirements is a complex problem caused by the heterogeneity of the users and their varied interests and demands. In this paper, it is justified that their is a strong need of optimization in requirement analysis. The paper argues that requirement selection can be viewed as an application area of Search-Based Software Engineering(SBSE). The aim is to justify the claim that requirement engineering can be re-formulated as search problem to which meta-heuristic technique can be applied.
Complexity of finite state Turing machine with other domain Rajesh Kumar; Anju Jain; Rakesh Kumar
Computer Science and Information Technologies Vol 7, No 2: July 2026
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/csit.v7i2.p196-202

Abstract

In this paper, the authors investigate and discussed the non-deterministic state complexity of certain operations on finite state Turing machine on other domain which includes partial function and natural function over an alphabet set Σ∗. It is found that in some boolean operations on said domains, the state complexity reaches up to upper bound O( √ n!). This result is complement for the operation on Kleene star-free unary and recursive languages accepted by the finite state Turing machine.
Co-Authors Anju Jain Rakesh Kumar