scientific article; zbMATH DE number 475414

zbMath0798.68059MaRDI QIDQ4273661

Detlef Seese

Publication date: 31 October 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tree automatacomplexity theorydecidability of monadic second-order theories

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of tessellation and tiling problems (05B45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Trees, grids, and MSO decidability: from graphs to matroids ⋮ Dominating sets whose closed stars form spanning trees ⋮ A logic of reachable patterns in linked data-structures ⋮ Inductive computations on graphs defined by clique-width expressions ⋮ The monadic second-order logic of graphs. XV: On a conjecture by D. Seese ⋮ Counting modulo quantifiers on finite structures

This page was built for publication: