Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    edoccha_9959186271902883
    Umfang: 1 online resource (X, 486 p.)
    Ausgabe: 1st ed. 1979.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-35091-8
    Serie: Lecture Notes in Computer Science, 73
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , to the algebraic theory of graph grammars (a survey) -- A tutorial and bibliographical survey on graph grammars -- Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls -- Rewriting systems as a tool for relational data base design -- Programmed graph grammars -- Shortest path problems and tree grammars: An algebraic framework -- Constructing specifications of abstract data types by replacements -- Decomposition of graph grammar productions and derivations -- Locally star gluing formulas for a class of parallel graph grammars -- Transformations of data base structures -- Explicit versus implicit parallel rewriting on graphs -- Two-level graph grammars -- A pumping lemma for context-free graph languages -- Two-dimensional, differential, intercalary plant tissue growth and parallel graph generating and graph recurrence systems -- Parallel generation of maps: Developmental systems for cell layers -- Processes in structures -- Map grammars: Cycles and the algebraic approach -- On multilevel — Graph grammars -- Graph grammars and operational semantics -- Complexity of pattern generation by map-L systems -- A graph grammar that describes the set of two-dimensional surface networks -- Definition of programming language semantics using grammars for hierarchical graphs -- Determinism in relational systems -- Analysis of programs by reduction of their structure -- Graphs of processors -- Definitional mechanisms for conceptual graphs -- A graph-like lambda calculus for which leftmost-outermost reduction is optimal -- Relationships between graph grammars and the design and analysis of concurrent software -- Cellular graph automata -- List of participants. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-09525-X
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz