Cellular automata between sofic tree shifts (Q393113): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6246037 / rank
 
Normal rank
Property / zbMATH Keywords
 
free monoid
Property / zbMATH Keywords: free monoid / rank
 
Normal rank
Property / zbMATH Keywords
 
regular rooted tree
Property / zbMATH Keywords: regular rooted tree / rank
 
Normal rank
Property / zbMATH Keywords
 
tree shift
Property / zbMATH Keywords: tree shift / rank
 
Normal rank
Property / zbMATH Keywords
 
subshift
Property / zbMATH Keywords: subshift / rank
 
Normal rank
Property / zbMATH Keywords
 
shift of finite type
Property / zbMATH Keywords: shift of finite type / rank
 
Normal rank
Property / zbMATH Keywords
 
sofic shift
Property / zbMATH Keywords: sofic shift / rank
 
Normal rank
Property / zbMATH Keywords
 
unrestricted Rabin automaton
Property / zbMATH Keywords: unrestricted Rabin automaton / rank
 
Normal rank
Property / zbMATH Keywords
 
cellular automaton
Property / zbMATH Keywords: cellular automaton / rank
 
Normal rank
Property / zbMATH Keywords
 
surjectivity problem
Property / zbMATH Keywords: surjectivity problem / rank
 
Normal rank
Property / zbMATH Keywords
 
injectivity problem
Property / zbMATH Keywords: injectivity problem / rank
 
Normal rank

Revision as of 14:36, 29 June 2023

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

    Identifiers