Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59567455, #quickstatements; #temporary_batch_1711565664090 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2179584097 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59567455 / rank | |||
Normal rank | |||
Latest revision as of 21:00, 27 March 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
