Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (Q1578419)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees |
scientific article |
Statements
Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (English)
0 references
27 August 2000
0 references
graph decision problems
0 references
tree automaton
0 references
