Graph-grammars and their application to computer science : 3rd international workshop, Warrenton, Virginia, USA, December 2-6, 1986

The generic term "graph-grammars" refers to a variety of methods for specifying (possibly infinite) sets of graphs or sets of maps. The area of graph-grammars originated in the late 60s motivated by considerations concerning pattern recognition - since then the list of areas which have int...

Полное описание

Сохранить в:
Библиографические подробности
Соавтор: International workshop on Graph grammars and their application to computer science :Warrenton
Другие авторы: Nagl, Manfred, 1944- (Публикующий директор), Ehrig, Hartmut, 1944- (Публикующий директор), Rozenberg, Grzegorz, 1942- (Публикующий директор)
Формат: Livre numérique
Язык:Anglais
Опубликовано: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Серии:Lecture notes in computer science 291
Предметы:
Online-ссылка:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Примечание: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Graph-grammars and their application to computer science, 3rd international workshop, Warrenton, Virginia, USA, December 2-6, 1986, [proceedings], H. Ehrig ... [et al.] (eds.), Berlin, Springer-Verlag, 1987, 1 vol. (VIII-609 p.), Lecture notes in computer science, 0-387-18771-5
• Graph-Grammars and Their Application to Computer Science, Texte imprimé, 9783540187714
• Graph-Grammars and Their Application to Computer Science, Texte imprimé, 9783662182031
Оглавление:
  • Tutorial introduction to the algebraic approach of graph grammars
  • May we introduce to you: Hyperedge replacement
  • An introduction to parallel map generating systems
  • Set theoretic approaches to graph grammars
  • An introduction to the NLC way of rewriting graphs
  • Array grammars
  • Graph grammar based specification of interconnection structures for massively parallel computation
  • Towards distributed graph grammars
  • On partially ordered graph grammars
  • A representation of graphs by algebraic expressions and its use for graph rewriting systems
  • On context-free sets of graphs and their monadic second-order theory
  • Restricting the complexity of regular DNLC languages
  • Apex graph grammars
  • Graph grammar engineering: A software specification method
  • A linguistic formalism for engineering solid modeling
  • Graph grammars and diagram editing
  • Graphics and their grammars
  • On network algebras and recursive equations
  • Ada-concurrency specified by graph grammars
  • Basic notions of actor grammars
  • Embedding rule independent theory of graph grammars
  • Supporting the software development process with attributed NLC graph grammars
  • Practical applications of precedence graph grammars
  • Is parallelism already concurrency? Part 1: Derivations in graph grammars
  • Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars
  • Map OL-systems with edge label control: Comparison of marker and cyclic systems
  • From 0L and 1L map systems to indeterminate and determinate growth in plant morphogenesis
  • Fundamentals of edge-label controlled graph grammars
  • Parallelism analysis in rule-based systems using graph grammars
  • An efficient algorithm for the solution of hierarchical networks of constraints
  • A software development environment based on graph technology
  • Map 0L systems with markers
  • Graph rewriting with unification and composition
  • Complexity of pattern generation via planar parallel binary fission/fusion grammars
  • Applications of L-systems to computer imagery
  • Advances in array languages
  • Rosenfeld's cycle grammars and kolam
  • Application of graph grammars in music composing systems
  • Boundary NLC and partition controlled graph grammars.