Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
From MaRDI portal
Publication:3521904
DOI10.1007/978-3-540-70575-8_1zbMath1143.68433OpenAlexW1606374303MaRDI QIDQ3521904
No author found.
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_1
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (7)
Courcelle's theorem -- a game-theoretic approach ⋮ The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs ⋮ Logics and Automata for Totally Ordered Trees ⋮ $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs ⋮ Treewidth and logical definability of graph products ⋮ An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning ⋮ An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
This page was built for publication: Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
