Context-Free Graph Properties via Definable Decompositions

DOI10.4230/LIPICS.CSL.2016.17MaRDI QIDQ5278403zbMATH OpenOpenAlexFDO

Authors Michael Elberfeld

Publication date 19 July 2017

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.CSL.2016.17

zbMATH Keywords

context-free languagesexpressive powerfinite model theorymonadic second-order logictree decomposition

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Decomposable graphs and definitions with no quantifier alternation
• Decomposable graphs and definitions with no quantifier alternation
• On the definability of properties of finite graphs
• Graph decompositions definable in monadic second-order logic
• scientific article; zbMATH DE number 56048
• scientific article; zbMATH DE number 5872389
• Definable decompositions for graphs of bounded linear cliquewidth
• Definable decompositions for graphs of bounded linear cliquewidth
• Deterministic Dcomposition of Recursive Graph Classes
• scientific article; zbMATH DE number 4049098

Cited in

(3)

• scientific article; zbMATH DE number 56048 (Why is no real title available?)
• On supergraphs satisfying CMSO properties
• scientific article; zbMATH DE number 6739879 (Why is no real title available?)

This page was built for publication: Context-Free Graph Properties via Definable Decompositions

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