Graph Operations, Graph Transformations and Monadic Second-Order Logic:

DOI10.1016/S1571-0661(04)80196-8zbMath1263.68071MaRDI QIDQ4923534

No author found.

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Nondeterministic Streaming String Transducers ⋮ Non-deterministic transducer models of retransmission protocols over noisy channels

Cites Work

• Unnamed Item
• Unnamed Item
• The structure of the models of decidable monadic theories of graphs
• All structured programs have small tree width and good register allocation
• Monadic second-order logic, graph coverings and unfoldings of transition systems
• The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• Handbook of Graph Grammars and Computing by Graph Transformation

This page was built for publication: Graph Operations, Graph Transformations and Monadic Second-Order Logic: