1993 | OriginalPaper | Buchkapitel
Flowchart Behaviors
verfasst von : Stephen L. Bloom, Zoltán Ésik
Erschienen in: Iteration Theories
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This chapter deals with the structures which serve as the standard models for (functorial) flowchart semantics. Recall from Example 11.1.7 that one can identify a flowchart scheme n → p with a presentation D = (α; a) in a free tree theory ∑tr. (Here α is a partial base morphism and each component of a is the composite of an atomic tree with a partial base morphism.) Thus, if T is any iteration theory and φ: ∑ → T is any function mapping letters in ∑ n to morphisms 1 → n in T, n > 0, φ extends uniquely to both a theory morphism ∑tr → T and also to a morphism of presentations: $$ D\varphi : = \left( {\alpha ;a\varphi } \right). $$