Autowrite
From MaRDI portal
Cited in
(8)- Decidable call-by-need computations in term rewriting
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Special tree-width and the verification of monadic second-order graph properties
- Graph structure and monadic second-order logic. A language-theoretic approach
- Treewidthlib
- McCLIM
- Automata for the verification of monadic second-order graph properties
- Fly-automata, their properties and applications
This page was built for software: Autowrite