On hardest languages for one-dimensional cellular automata (Q6186307)

From MaRDI portal
Revision as of 19:16, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7798805
Language Label Description Also known as
English
On hardest languages for one-dimensional cellular automata
scientific article; zbMATH DE number 7798805

    Statements

    On hardest languages for one-dimensional cellular automata (English)
    0 references
    0 references
    0 references
    2 February 2024
    0 references
    cellular automata
    0 references
    hardest languages
    0 references
    homomorphisms
    0 references
    finite transducers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers