Complete simulation of automata networks (Q2301357): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1504.00169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network information flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequentialization and procedural complexity in automata networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed iterative calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary decompositions of arbitrary maps over finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping Computation with No Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5413906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three generators for minimal writing-space computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic sequential computations of Boolean mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential computation of linear Boolean mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in matrix groups without memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in permutation groups without memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Theory of Automata Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on isomorphic simulation of automata by networks of two-state automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memoryless computation: new results, constructions, and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel calculation of a linear mapping on a computer network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel realization of permutations over trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Boolean functions on networks of binary automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Factorization on Star-Connected Networks of Binary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation on binary tree-networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809281 / rank
 
Normal rank

Latest revision as of 21:21, 21 July 2024

scientific article
Language Label Description Also known as
English
Complete simulation of automata networks
scientific article

    Statements

    Complete simulation of automata networks (English)
    0 references
    0 references
    0 references
    24 February 2020
    0 references
    complete simulation
    0 references
    automata networks
    0 references
    memoryless computation
    0 references
    transformation semigroups
    0 references
    symmetric group
    0 references
    models of computation
    0 references
    computational difficulty
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references