Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications

DOI10.1007/978-3-642-00982-2_2zbMath1234.03023OpenAlexW1540247986MaRDI QIDQ3618564

No author found.

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Algorithmic uses of the Feferman-Vaught theorem
• Monadic second-order evaluations on tree-decomposable graphs
• Linear time solvable optimization problems on graphs of bounded clique-width

This page was built for publication: Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications