20
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

FTD Grammar Graph

Pages 1-9 | Published online: 15 Sep 2010
 

The notations of (1) KBO: Knowledge Based Object, (2) FTD: Formally Technology Dependent, (3) WW KBO: Window Womb KBO, (4) PL KBO: Programming Language KBO, (5) APM KBO: Abstract Processing Machine KBO, and (6) AIPM KBO: Abstract Information Processing Mechanism KBO, were studied in U¨nlu¨ [1-3]. Let the meaning of an arbitrarily chosen X :=\langle X^o,X,X^+\rangle\ \hbox{KBO} representation be recursively X takes the value of X^o in the initial states, or the value of X in the present states, or the value of X^+ in the next states. 1 1 Where X^o stands for the initial state value of X , X stands for the present state value of X , X^+ stands for the next state value of X . This paper introduces, finds or develops the following abstract tools on an objective u KBO in an organization \hbox{O}=(\hbox{W, u.W, u, u.E, E, T}_{\rm B}) KBO in an arbitrary u.W KBO in a WW KBO type W: (1) A FTD formal grammar type \hbox{G} := \langle \hbox{G}^{\rm o}, \hbox{G, G}^+\rangle\ \hbox{KBO} , (2) A FTD formal grammar graph type \hbox{gG} := \langle \hbox{gG}^{\rm o}, \hbox{gG, gG}^+\rangle\ \hbox{KBO} , (3) An AIPM KBO type Algorithm A for translating from a FTD formal grammar type G KBO to a formal graph type gG KBO and an inverse Algorithm B for translating vise versa. (4) A via-state dependent differential operator \hbox{D} := \langle\hbox{D}^{\rm o}, \hbox{D, D}^+\rangle and a via-state dependent integral operator \hbox{I} := \langle \hbox{I}^{\rm o}, \hbox{I, I}^+\rangle , on the FTD formal grammar graph type gG. (5) A horizon type H KBO on a FTD formal grammar graph gG KBO and a frame type F on a FTD formal grammar G KBO. (6) A FTD contemporary Science Frame cSF \hbox{S} = (\hbox{S}_{\rm w}, \hbox{S}_{\rm u.w}, \hbox{S}_{\rm u}, \hbox{S}_{\rm u.E}, \hbox{S}_{\rm E}, \hbox{S}_{\rm {T_B}}) KBO model on the objective u KBO in u.W in W via D and I. (7) A result that it can be stated as "a FTD formal grammar type G via its FTD formal grammar graph gG under D and I is a formal abstraction mechanism to produce a FTD contemporary Science Frame cSF type S KBO science model on an objective u in u.W in W".

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.