A comparison of compatible, finite, and inductive graph properties

DOI10.1016/0304-3975(93)90354-VMaRDI QIDQ1812942zbMATH OpenFDO

Authors Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann

Publication date 25 June 1992

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(93)90354-V

zbMATH Keywords

context-free graph grammardecision problemshyperedge-replacement

Mathematics Subject Classification ID

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

Review text

See the preview in Zbl 0706.68068.

Cites work

• Easy problems for tree-decomposable graphs
• Graph expressions and graph rewritings
• scientific article; zbMATH DE number 4035178 (Why is no real title available?)
• scientific article; zbMATH DE number 4049098 (Why is no real title available?)
• scientific article; zbMATH DE number 4060749 (Why is no real title available?)
• scientific article; zbMATH DE number 45244 (Why is no real title available?)
• scientific article; zbMATH DE number 219278 (Why is no real title available?)
• scientific article; zbMATH DE number 965 (Why is no real title available?)
• Hyperedge replacement: grammars and languages
• Metatheorems for decision problems on hyperedge replacement graph languages
• Monadic second-order evaluations on tree-decomposable graphs
• Plex languages
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(5)

• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
• Recognizable sets of graphs: equivalent definitions and closure properties
• Recognizable languages of arrows and cospans
• Process specification and verification
• Decision problems for edge grammars

This page was built for publication: A comparison of compatible, finite, and inductive graph properties

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