Atlas home || Conferences | Abstracts | about Atlas

International Conference on Mathematical Modeling and Scientific Computing
April 2-6, 2001
Middle East Technical University and Selcuk University
Ankara and Konya, Turkey

Organizers
F. Bornemann (Munich University of Tecnology, Germany), H. Bulgak (Selcuk University, Konya, Turkey), V. Ganzha (Munich University of Technology, Germany), B. Karasozen (METU, Ankara, Turkey), A. Sinan (Selcuk University, Konya, Turkey), C. Zenger (Munich University of Technology, Germany)

View Abstracts
Conference Homepage

FTD Grammar Graph
by
Fevzi Ünlü
Computer Science Division, Department of Mathematics, Ege University, Izmir

Let u0 in W0, u- in W- or u+ in W+ be realizations for an objective KBO U = <u0, u-, u+>. EW0 in W0, EW- in W- or EW+ in W+ be realizations for its environmental KBO E = <EW0, EW-, EW+ > in an arbitrary window-womb type W that defined in the initial state, in the present state or in the next state of a universal window-womb W = <W0, W-, W+ >. Let M be a processing machine runs under an information processing mechanism M which is coded in a FTD (Formally Technology Dependent) programming language L generated by a FTD grammar G = <G0, G-, G+ >. TB be a threshold logic for controlling the states and the internal structures of window-womb W's in W; U = <u0, u-, u+ > or an organization of 0 = (W, U, E, TB) be realized by M on M in a W of W as a KBO that simulated or coded in L which is generated by a FTD grammar type G = <G0, G-, G+> under the controlling power of TB.

This paper finds:

  1. A FTD grammar type G = <G0, G+ >.

  2. A FTD graph type G = <G0, G-, G+ >.

  3. Algorithms for translating from FTD grammar type G = <G0, G-, G+ > to FTD graph type G = <G0, G-, G+ > and vise versa.

  4. A via-state dependent differential operator D = <D0, D-, D+ > and a via-state dependent integral operator I = <I0, I-, I+ > on the FTD graph type G = <G0, G-, G+ > to obtain differentiation or integration of L via the FTD grammar type G = <G0, G-, G+ > that was derived from a universal grammar G.

  5. An intuitive FTD KBO model to generate and direct the science in the form of a KBO S = (Sx, Sy, Sz, Sv) on U of O in a W of W of W via D and I.

  6. A result that it can be stated as ``a FTD grammar type G = <G0, G-, G+ > via its FTD graph type G = <G0, G-, G+ > under D and I is a formal abstraction mechanism to produce contemporary science as a KBO S on a KBO U of O in a W of W''.

Date received: February 13, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cagk-52.