Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Computer Science and Information Technologies
Anju Jain
Government College
Computer Science & IT Engineering

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

Found 1 Documents
Search

 1 
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 Rajesh Kumar Rakesh Kumar