Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (Q1578419)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1496850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees |
scientific article; zbMATH DE number 1496850 |
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
0.8520629405975342
0 references
0.8299521803855896
0 references
0.8289085030555725
0 references
0.8121179938316345
0 references
