COMMUNICATING TASIM OT-GENETIC QUANTUM KBO MEMORY MODULES CLOSURE

Yıl 2009, Cilt: 4 Sayı: 16, 2611 - 2635, 01.06.2009

Fevzi Ünlü

Öz

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 of Computation [1, 2]. The notions of classical logic, sets and recursion are well known [3]. We know that in the last five decades; computer hardware has undergone dramatic cost reduction by the application of the classical logic [4]. This has not been accomplished by corresponding reductions in the software cost of the computing systems. For this reason, a Tidy Automatic Sequential Information-Processing Mechanism, which is briefly called TASIM, was developed [5, 6, and 7]. It is functionally a high-level formal language for designing and realizing logic objects leading to the construction of an instant FLAHOB machine and language pairs [8, and 9]. In this article, an abstract and advanced TASIM o T-genetic quantum KBO generating formal language o T will be designed. o T-genetic quantum KBO codes structured in o T will be used for developing some optimize able linear o T-genetic quantum memory module closures.

Anahtar Kelimeler

COMMUNICATING, OT-GENETIC, TASIM

COMMUNICATING TASIM OT-GENETIC QUANTUM KBO MEMORY MODULES CLOSURE

Öz

Kaynakça

• Linz, P.: An Introduction to Formal Languages and Automata, Fourth Edition, Jones and Bartlett Publishers, London, 2006.
• Denning, P., Dennis, J. B.; Joseph, E.Q.: Machines, Languages, and Computation, Prentice-Hall, Inc., Englewood Cliffs, N.J07632, 1978.
• Causey, R. L.: Logic, Sets, and Recursion, Second Edition, Jones and Bartlett Publishers, Inc., London, 2006
• Roth, C. H.: Fundamentals of Logic Design, Third Edition, West Publishing Company, St. Paul, Minnesota, 55164, 1985.
• Ünlü, F.: Kuramsal λ-Tasımlaması, Atatürk Üniversitesi Basımevi, Erzurum, 1976.
• Ünlü, F.: A TASIM Logic realization of Boolean algebra, DIRASAT. A Research Journal, the University of Jordan, XIII (7): pp67-76, Amman, 1986.
• Ünlü, F.: A TASIM Logic realization of Boolean algebra, DIRASAT. A Research Journal, the University of Jordan, XIV (12): 61-80, Amman, 1987.
• Ünlü, F.: CITALOG: Compact and Integrated Tasim Logic Closure, Journal of King Abdulaziz University, Science, Vol. 2 pp117-136, Jeddah, 1990.
• Ü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.
• FTD Grammar Graph, International Journal of Computer Mathematics, 2003, Vol. 80(1), pp. 1-9.