Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323)
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: Recognizability equals definability for graphs of bounded treewidth and bounded chordality |
scientific article; zbMATH DE number 6639418
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizability equals definability for graphs of bounded treewidth and bounded chordality |
scientific article; zbMATH DE number 6639418 |
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
0 references
0 references
0.9709221
0 references
0.9447956
0 references
0.9369931
0 references
0.91069376
0 references
0.90269136
0 references
0.88818955
0 references
0.87685657
0 references
