Complexity of finite state Turing machine with other domain
Computer Science and Information Technologies · 01.07.2026 · 7 (2) · 196-202
DOI: 10.11591/csit.v7i2.p196-202 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Science and Information Technologies, online erschienen am 01.07.2026. Verfasst von Rajesh Kumar und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).
Abstract (Originalsprache)
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 Kleen star-free unary and recursive languages accepted by the finite state Turing machine.
Zitieren
APA
Kumar, R., Jain, A., & Kumar, R. (2026). Complexity of finite state Turing machine with other domain. Computer Science and Information Technologies, 7(2), 196-202. https://doi.org/10.11591/csit.v7i2.p196-202
Vancouver
Kumar R, Jain A, Kumar R. Complexity of finite state Turing machine with other domain. Computer Science and Information Technologies. 2026;7(2):196-202. doi:10.11591/csit.v7i2.p196-202
BibTeX
@article{Kumar2026,
author = {Kumar, Rajesh and Jain, Anju and Kumar, Rakesh},
title = {Complexity of finite state Turing machine with other domain},
journal = {Computer Science and Information Technologies},
year = {2026},
volume = {7},
number = {2},
pages = {196--202},
doi = {10.11591/csit.v7i2.p196-202}
}
EUVIMED