Monadic second order logic, tree automata and forbidden minors
- 1 January 1991
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Problems easy for tree-decomposable graphs extended abstractPublished by Springer Nature ,1988
- Nonconstructive advances in polynomial-time complexityInformation Processing Letters, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Graph minors. VI. Disjoint paths across a discJournal of Combinatorial Theory, Series B, 1986
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- Separating subgraphs in k-trees: Cables and caterpillarsDiscrete Mathematics, 1984
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968