Clique‐convergence is undecidable for automatic graphs (Q6055401)

From MaRDI portal
Revision as of 18:01, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7743902
Language Label Description Also known as
English
Clique‐convergence is undecidable for automatic graphs
scientific article; zbMATH DE number 7743902

    Statements

    Clique‐convergence is undecidable for automatic graphs (English)
    0 references
    0 references
    0 references
    29 September 2023
    0 references
    automatic structures
    0 references
    clique graphs
    0 references
    decidability
    0 references
    graph dynamics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references