Hyperedge replacement : grammars and languages
The area of graph grammars is theoretically attractive and well motivated byvarious applications. More than 20 years ago, the concept of graph grammars was introduced by A. Rosenfeld as a formulation of some problems in pattern recognition and image processing, as well as by H.J. Schneider as a meth...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
643 |
| 主題: | |
| オンライン･アクセス: | 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: | • Hyperedge replacement, grammars and languages, A. Habel, Berlin, Springer-Verlag, 1992, 1 vol. (X-214 p.), Lecture notes in computer science, 3-540-56005-X • Hyperedge Replacement: Grammars and Languages, Texte imprimé, 9783662209844 |
目次:
- General Introduction
- to hyperedge-replacement grammars
- Basic properties of HRG's
- Characterizations of HRL's
- Structural aspects of HRL's
- Generative power of HRG's
- Graph-theoretic aspects of HRL's
- Boundedness aspects of HRL's
- Extensions and variations of HRG's
- Conclusion.