Representing graph families with edge grammars

DOI10.1016/0020-0255(93)90080-6zbMath0798.68138OpenAlexW2054307229MaRDI QIDQ1801468

Gregory E. Shannon, Francine Berman

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)

Related Items (2)

Automatic graphs and D0L-sequences of finite graphs ⋮ Decision problems for edge grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
• Pair grammars, graph languages and string-to-graph translations
• Universality considerations in VLSI circuits
• Ultracomputers
• Bounds on the costs of data encodings
• Turing machines with restricted memory access
• Parallel Processing with the Perfect Shuffle

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