Reachability problem in non-uniform cellular automata (Q2053879): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3675526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reachability problem for finite cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of finite cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Rule Distributions of Non-uniform Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Co-evolving non-uniform cellular automata to perform computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4357204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5219757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank

Revision as of 08:17, 27 July 2024

scientific article
Language Label Description Also known as
English
Reachability problem in non-uniform cellular automata
scientific article

    Statements

    Reachability problem in non-uniform cellular automata (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2021
    0 references
    non-uniform cellular automata
    0 references
    reachability tree
    0 references
    rule min-term (RMT)
    0 references

    Identifiers