TY  - JOUR
T1  - COMMUNICATING TASIM OT-GENETIC QUANTUM KBO MEMORY MODULES CLOSURE
TT  - COMMUNICATING TASIM OT-GENETIC QUANTUM KBO MEMORY MODULES CLOSURE
AU  - Ünlü, Fevzi
PY  - 2009
DA  - June
JF  - Yaşar Üniversitesi E-Dergisi
PB  - Yaşar Üniversitesi
WT  - DergiPark
SN  - 1305-970X
SP  - 2611
EP  - 2635
VL  - 4
IS  - 16
LA  - en
AB  - A Communicating TASIM o T-Genetic Quantum KBO Memory Modules Closure is introduced in this paper by using the background information exists in the given references [1-10].Formal languages and Machine Theory are two important notions in the Theory ofComputation [1, 2]. The notions of classical logic, sets and recursion are well known [3]. Weknow that in the last five decades; computer hardware has undergone dramatic cost reductionby the application of the classical logic [4]. This has not been accomplished by correspondingreductions in the software cost of the computing systems. For this reason, a Tidy AutomaticSequential Information-Processing Mechanism, which is briefly called TASIM, wasdeveloped [5, 6, and 7]. It is functionally a high-level formal language for designing andrealizing logic objects leading to the construction of an instant FLAHOB machine andlanguage pairs [8, and 9]. In this article, an abstract and advanced TASIM oT-genetic quantumKBO generating formal language oT will be designed. oT-genetic quantum KBO codesstructured in oT will be used for developing some optimize able linear oT-genetic quantummemory module closures.
KW  - COMMUNICATING
KW  - OT-GENETIC
KW  - TASIM
CR  - Linz, P.: An Introduction to Formal Languages and Automata, Fourth Edition, Jones and Bartlett Publishers, London, 2006.
CR  - Denning, P., Dennis, J. B.; Joseph, E.Q.: Machines, Languages, and Computation, Prentice-Hall, Inc., Englewood Cliffs, N.J07632, 1978.
CR  - Causey, R. L.: Logic, Sets, and Recursion, Second Edition, Jones and Bartlett Publishers, Inc., London, 2006
CR  - Roth, C. H.: Fundamentals of Logic Design, Third Edition, West Publishing Company, St. Paul, Minnesota, 55164, 1985.
CR  - Ünlü, F.: Kuramsal λ-Tasımlaması, Atatürk Üniversitesi Basımevi, Erzurum, 1976.
CR  - Ünlü, F.: A TASIM Logic realization of Boolean algebra, DIRASAT. A Research Journal, the University of Jordan, XIII (7): pp67-76, Amman, 1986.
CR  - Ünlü, F.: A TASIM Logic realization of Boolean algebra, DIRASAT. A Research Journal, the University of Jordan, XIV (12): 61-80, Amman, 1987.
CR  - Ünlü, F.: CITALOG: Compact and Integrated Tasim Logic Closure, Journal of King Abdulaziz University, Science, Vol. 2 pp117-136, Jeddah, 1990.
CR  - Ünlü, F.: Instant (FLA, HOB) Computational Management System KBO Model Design, Int. Journal of Contemp. Math. Sciences, Vol. 1, 2006, no. 5-8, 223 - 235.
CR  - FTD Grammar Graph, International Journal of Computer Mathematics, 2003, Vol. 80(1), pp. 1-9.
UR  - https://dergipark.org.tr/tr/pub/jyasar/article/202979
L1  - https://dergipark.org.tr/tr/download/article-file/179250
ER  -