MARC record from Internet Archive

LEADER: 04476cam 2200841 a 4500
001 ocm26934727
003 OCoLC
005 20201218210353.0
008 921006s1992 gw a b 001 0 eng
006 m d
007 cr unu|uuuuu||
010 $a 92033562
040 $aDLC$beng$cDLC$dRRR$dMUQ$dBAKER$dNLGGC$dBTCTA$dYDXCP$dOCLCG$dGBVCP$dHEBIS$dOCLCQ$dZWZ$dOCLCQ$dBDX$dOCLCO$dMUU$dOCLCF$dOCLCQ$dTFW$dDEBSZ$dOCLCQ$dOCLCO$dOCLCQ$dLWA$dIL4J6$dOCLCO
015 $a92,N51,0434$2dnb
015 $a93,A16,0938$2dnb
016 7 $a930076028$2DE-101
019 $a190831664$a811369319$a969365226$a978100201$a1004794332$a1012017744$a1013288761$a1120912609$a1162740020$a1164058095$a1165349033$a1173267645$a1191401686
020 $a038756005X$q(USA ;$qalk. paper)
020 $a9780387560052$q(USA ;$qalk. paper)
020 $a354056005X$q(Berlin)
020 $a9783540560050$q(Berlin)
035 $a(OCoLC)26934727$z(OCoLC)190831664$z(OCoLC)811369319$z(OCoLC)969365226$z(OCoLC)978100201$z(OCoLC)1004794332$z(OCoLC)1012017744$z(OCoLC)1013288761$z(OCoLC)1120912609$z(OCoLC)1162740020$z(OCoLC)1164058095$z(OCoLC)1165349033$z(OCoLC)1173267645$z(OCoLC)1191401686
050 00 $aQA76$b.H22 1992
082 00 $a005.13/1$220
084 $a31.12$2bcl
084 $a31.76$2bcl
084 $a54.10$2bcl
084 $a54.71$2bcl
084 $a28$2sdnb
100 1 $aHabel, A.$q(Annegret)
245 10 $aHyperedge replacement :$bgrammars and languages /$cA. Habel.
260 $aBerlin ;$aNew York :$bSpringer-Verlag,$c©1992.
300 $ax, 214 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aLecture notes in computer science ;$v643
504 $aIncludes bibliographical references (pages 195-205) and index.
520 $a"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 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."--PUBLISHER'S WEBSITE.
650 0 $aComputer science.
650 0 $aGraph grammars.
650 6 $aInformatique.
650 6 $aGrammaires de graphes.
650 7 $aComputer science.$2fast$0(OCoLC)fst00872451
650 7 $aGraph grammars.$2fast$0(OCoLC)fst00946582
650 7 $aGraph-Grammatik$2gnd
650 7 $aHypergraph$2gnd
650 7 $aFormal languages.$2nli
650 7 $aGraph grammars.$2nli
650 7 $aLogic, Symbolic and mathematical.$2nli
650 7 $aGraph theory.$2nli
650 7 $aGrammaires de graphes.$2ram
650 7 $aInformatique.$2ram
650 7 $aHypergraphes.$2ram
653 0 $aComputer science
653 0 $aGraph grammars
655 4 $aElectronic resources (Books)
830 0 $aLecture notes in computer science ;$v643.
856 41 $3(n.149, 1983 - current) available via SpringerLink$uhttp://www.library.tufts.edu/ezproxy/ezproxy.asp?LOCATION=SpLinkLeNoCoSc
856 41 $3Table of contents$uhttp://www.gbv.de/dms/bowker/toc/9780387560052.pdf
856 4 $3Cover$uhttp://swbplus.bsz-bw.de/bsz031284523cov.htm$v20150910142301
938 $aBaker & Taylor$bBKTY$c59.95$d59.95$i038756005X$n0002224063$sactive
938 $aBrodart$bBROD$n45608814$c$38.00
938 $aBaker and Taylor$bBTCP$n92033562
938 $aYBP Library Services$bYANK$n100041117
029 1 $aAU@$b000009603928
029 1 $aDEBSZ$b031284523
029 1 $aGBVCP$b120851393
029 1 $aHEBIS$b022838139
029 1 $aNLGGC$b102324409
029 1 $aNZ1$b4182593
994 $aZ0$bP4A
948 $hNO HOLDINGS IN P4A - 200 OTHER HOLDINGS