A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Trees, grids, and MSO decidability: From graphs to matroids
2006
Theoretical Computer Science
Monadic second order (MSO) logic has proved to be a useful tool in many areas of application, reaching from decidability and complexity to picture processing, correctness of programs and parallel processes. To characterize the structural borderline between decidability and undecidability is a classical research problem here. This problem is related to questions in computational complexity, especially to the model checking problem, for which many tools developed in the area of decidability have
doi:10.1016/j.tcs.2005.10.006
fatcat:dtsh4w7hs5dbtkz6nyqjef3cp4