Representing graph families with edge grammars

DOI10.1016/0020-0255(93)90080-6MaRDI QIDQ1801468zbMATH OpenOpenAlexFDO

Authors Francine Berman, Gregory E. Shannon

Publication date 21 July 1993

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cstech/437

zbMATH Keywords

decidabilityedge grammaredge rewritingregular graph families

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Recommendations

• Edge-label controlled graph grammars
• scientific article; zbMATH DE number 4049107
• scientific article; zbMATH DE number 177422
• scientific article; zbMATH DE number 3888930
• Structure graphs and structure graph grammars
• Boundary graph grammars with dynamic edge relabeling
• Introduction to graph grammars with applications to semantic networks
• Graph grammars with path-controlled embedding
• A hierarchy of eNCE families of graph languages

Cites work

• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3410623 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• A framework for solving VLSI graph layout problems
• Bounds on the costs of data encodings
• Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
• On the structure of node-label-controlled graph languages
• Pair grammars, graph languages and string-to-graph translations
• Parallel Processing with the Perfect Shuffle
• Restrictions, extensions, and variations of NLC grammars
• Turing machines with restricted memory access
• Ultracomputers
• Universality considerations in VLSI circuits

Cited in

(9)

• Decision problems for edge grammars
• scientific article; zbMATH DE number 820118 (Why is no real title available?)
• scientific article; zbMATH DE number 4182859 (Why is no real title available?)
• scientific article; zbMATH DE number 4049107 (Why is no real title available?)
• scientific article; zbMATH DE number 2112160 (Why is no real title available?)
• Edge-label controlled graph grammars
• Some new decision results for edge grammars
• Boundary graph grammars with dynamic edge relabeling
• Automatic graphs and D0L-sequences of finite graphs

This page was built for publication: Representing graph families with edge grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801468)