A linear speed-up theorem for cellular automata (Q1193411): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-state minimal time solution to the firing squad synchronization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On real-time cellular automata and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of Primes by a One-Dimensional Real-Time Iterative Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Machine Characterizations of Trellis and Cellular Automata and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A six-state minimal time solution to the Firing squad synchronization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time language recognition by one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimum solution to the firing squad synchronization problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:15, 16 May 2024

scientific article
Language Label Description Also known as
English
A linear speed-up theorem for cellular automata
scientific article

    Statements