Tree-verifiable graph grammars

DOI10.29007/8L13MaRDI QIDQ7025190zbMATH OpenFDO

Authors Mark Chimes, Radu Iosif, Florian Zuleger

Publication date 19 February 2025

Full work available at URL https://doi.org/10.29007/8L13

zbMATH Keywords

monadic second-order logicgraph grammarsbounded tree-width

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites work

• scientific article; zbMATH DE number 2086655 (Why is no real title available?)
• A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions
• A note on undecidable properties of formal languages
• BI as an assertion language for mutable data structures
• Concurrency, graphs and models. Essays dedicated to Ugo Montanari on the occasion of his 65th birthday
• Effective entailment checking for separation logic with inductive definitions
• Entailment checking in separation logic with inductive definitions is 2-ExpTime hard
• Regular expressions for tree-width 2 graphs
• Static Analysis
• Substructural logics: a primer
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• The tree width of separation logic with recursive definitions

Cited in

(1)

• Characterizations of monadic second order definable context-free sets of graphs

This page was built for publication: Tree-verifiable graph grammars

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