Reversible cellular automaton able to simulate any other reversible one using partitioning automata (Q5096335): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-59175-3_92 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1766924531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversibility of 2D cellular automata is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5333602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation-universality of one-dimensional one-way reversible cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tesselations with local transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation and construction universality of reversible cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invertible cellular automata: A review / rank
 
Normal rank

Latest revision as of 21:18, 29 July 2024

scientific article; zbMATH DE number 7572146
Language Label Description Also known as
English
Reversible cellular automaton able to simulate any other reversible one using partitioning automata
scientific article; zbMATH DE number 7572146

    Statements

    Identifiers