Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:29, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizability equals definability for graphs of bounded treewidth and bounded chordality |
scientific article |
Statements
Recognizability equals definability for graphs of bounded treewidth and bounded chordality (English)
0 references
14 October 2016
0 references
automata
0 references
recognizability
0 references
logic
0 references
definability
0 references
treewidth
0 references
chordality
0 references
