Cellular automata between sofic tree shifts (Q393113)

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





scientific article
Language Label Description Also known as
English
Cellular automata between sofic tree shifts
scientific article

    Statements

    Cellular automata between sofic tree shifts (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2014
    0 references
    free monoid
    0 references
    regular rooted tree
    0 references
    tree shift
    0 references
    subshift
    0 references
    shift of finite type
    0 references
    sofic shift
    0 references
    unrestricted Rabin automaton
    0 references
    cellular automaton
    0 references
    surjectivity problem
    0 references
    injectivity problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers