Fevzi ÜnlüÜnlü, Fevzi2025-10-06200310290265, 002071600020-71601029-026510.1080/002071603046612-s2.0-28244443577https://www.scopus.com/inward/record.uri?eid=2-s2.0-28244443577&doi=10.1080%2F00207160304661&partnerID=40&md5=fc7ee3be8da3c57175dd7d0149958a64https://gcris.yasar.edu.tr/handle/123456789/10389https://doi.org/10.1080/00207160304661The 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 Ünlü [1-3]. Let the meaning of an arbitrarily chosen X:= 〈X0 X X+〉 KBO representation be recursively X takes the value of X0 in the initial states or the value of X in the present states or the value of X+ in the next states.1 This paper introduces finds or develops the following abstract tools on an objective u KBO in an organization 0 = (W u.W u u.E E T<inf>B</inf>) KBO in an arbitrary u.W KBO in a WW KBO type W: (1) A FTD formal grammar type G:= 〈G 0 G G+) KBO (2) A FTD formal grammar graph type gG:= 〈gG0 gG gG+〉 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 D:= 〈D0 D D +〉 and a via-state dependent integral operator I:= (I 0 I I+) 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 S = (S <inf>w</inf> S<inf>u.w</inf> S<inf>u</inf> S<inf>u.E</inf> S<inf>E</inf> S<inf>TB</inf>) 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". © 2008 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessFormal Grammar, Knowledge Based Object Programming Language, Knowledge Based Tools, Algorithms, Data Processing, Graph Theory, Inverse Problems, Abstract Processing Machines, Formal Grammer, Knowledge Based Tools, Computer Programming LanguagesAlgorithms, Data processing, Graph theory, Inverse problems, Abstract Processing Machines, Formal grammer, Knowledge based tools, Computer programming languagesFormal GrammarKnowledge Based Object Programming LanguageKnowledge Based ToolsArticle