000 03018nam a22005055i 4500
001 978-3-540-47340-4
003 DE-He213
005 20160624102022.0
007 cr nn 008mamaa
008 121227s1992 gw | s |||| 0|eng d
020 _a9783540473404
_9978-3-540-47340-4
024 7 _a10.1007/BFb0013875
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
100 1 _aHabel, Annegret.
_eauthor.
245 1 0 _aHyperedge Replacement: Grammars and Languages
_h[electronic resource] /
_cby Annegret Habel.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1992.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1992.
300 _aXI, 221 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v643
505 0 _aGeneral 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.
520 _aThe 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 method for data type specification. Within graph-grammar theory one maydistinguish the set-theoretical approach, the algebraic approach, and the logical approach. These approaches differ in the method in which graph replacement is described. Specific approaches, node replacement and hyperedge replacement, concern the basic units of a hypergraph, nodes and hyperedges. This monograph is mainly concerned with the hyperedge-replacement approach. Hyperedge-replacement grammars are introduced as a device for generating hypergraph languages including graph languages and string languages. The concept combines a context-free rewriting with a comparatively large generative power. The volume includes a foreword by H. Ehrig.
650 0 _aComputer science.
650 0 _aCombinatorics.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aCombinatorics.
650 2 4 _aMathematical Logic and Foundations.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540560050
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v643
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0013875
942 _2EBK6056
_cEBK
999 _c35350
_d35350