Definability equals recognizability of partial 3-trees (Q6550548)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Definability equals recognizability of partial 3-trees |
scientific article; zbMATH DE number 7860258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Definability equals recognizability of partial 3-trees |
scientific article; zbMATH DE number 7860258 |
Statements
Definability equals recognizability of partial 3-trees (English)
0 references
5 June 2024
0 references
transitive closure
0 references
tree decomposition
0 references
internal vertex
0 references
outerplanar graph
0 references
tree automaton
0 references
0 references
0 references
