Graph operations, graph transformations and monadic second-order logic: a survey
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1512682 (Why is no real title available?)
- All structured programs have small tree width and good register allocation
- Clique-width of countable graphs: a compactness property
- Handbook of Graph Grammars and Computing by Graph Transformation
- Linear time solvable optimization problems on graphs of bounded clique-width
- 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.
- The structure of the models of decidable monadic theories of graphs
- Upper bounds to the clique width of graphs
Cited in
(7)- Non-deterministic transducer models of retransmission protocols over noisy channels
- Graph operators and its applications to context free languages
- An economical transformation of graph grammars
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
- Nondeterministic Streaming String Transducers
- scientific article; zbMATH DE number 1696755 (Why is no real title available?)
- scientific article; zbMATH DE number 2016096 (Why is no real title available?)
This page was built for publication: Graph operations, graph transformations and monadic second-order logic: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923534)
