Hyperedge Replacement: Grammars and Languages (Record no. 35350)

000 -LEADER
fixed length control field 03018nam a22005055i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540473404
-- 978-3-540-47340-4
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.131
100 1# - MAIN ENTRY--AUTHOR NAME
Personal name Habel, Annegret.
245 10 - TITLE STATEMENT
Title Hyperedge Replacement: Grammars and Languages
Statement of responsibility, etc by Annegret Habel.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1992.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XI, 221 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logic, Symbolic and mathematical.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Foundations.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/BFb0013875
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1992.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK6056 http://dx.doi.org/10.1007/BFb0013875 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha