<電子ブック>
Graph-Grammars and Their Application to Computer Science : 2nd International Workshop. Haus Ohrbeck, Germany, October 4 - 8, 1982 / edited by H. Ehrig, M. Nagl, G. Rozenberg
(Lecture Notes in Computer Science. ISSN:16113349 ; 153)
版 | 1st ed. 1983. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1983 |
本文言語 | 英語 |
大きさ | online resource |
著者標目 | Ehrig, H editor Nagl, M editor Rozenberg, G editor SpringerLink (Online service) |
件 名 | LCSH:Algorithms FREE:Algorithms |
一般注記 | Grammatical inference of graph grammars for syntactic pattern recognition -- Graph grammars as a generative tool in image understanding -- Graph grammars for distributed systems -- Algorithms for the generation and drawing of maps representing cell clones -- Aspects of concurrency in graph grammars -- Church-Rosser properties for graph replacement systems with unique splitting -- Specification of data bases through rewriting rules -- Petri nets and their relation to graph grammars -- Attributed graph grammars for graphics -- On context-free graph languages generated by edge replacement -- Modelling compiler generation by graph grammars -- Hypergraph systems generating graph languages -- Graph grammars with node-label controlled rewriting and embedding -- Parsing of graphs in linear time -- Generation of 3-dimensional plant bodies by double wall map and stereomap systems -- Chain code picture languages -- A graph-relational approach to geographic databases -- Graph transductions in the field of automatic translation of natural languages -- Software specification by graph grammars -- Geometry versus topology in Map grammars -- Transformation of structures by convex homomorphisms -- Formal specification of software using H-graph semantics -- Cellular computers for parallel region-level image processing -- Tree-graph grammars for pattern recognition -- The isomorphism problem is polynomially solvable for certain graph languages -- Space-filling curves and infinite graphs -- Two-level expression representation for faster evaluation -- Characterization of graph classes by forbidden structures and reductions -- On graph rewriting systems (Graph-Grammars) HTTP:URL=https://doi.org/10.1007/BFb0000094 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540398974 |
|
電子リソース |
|
EB00224949 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
別書名 | その他のタイトル:Under the auspices of the European Association for Theoretical Computer Science |
分 類 | LCC:QA76.9.A43 DC23:518.1 |
書誌ID | 4001088758 |
ISBN | 9783540398974 |