The Computing Power of Determinism and Reversibility in Chemical Reaction Automata (Q5112176): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inference of Reversible Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and maximally parallel multiset rewriting: reversibility and determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiset processing. Mathematical, computer science, and molecular computing points of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Communicating P Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5192981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON STRONG REVERSIBILITY IN <font>P</font> SYSTEMS AND RELATED PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversibility and Heat Generation in the Computing Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of a reversible two-counter machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible computing and cellular automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Way Reversible Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaction automata working in sequential manner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaction automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the properties of language classes defined by bounded reaction automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational capability of chemical reaction automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3406469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Turing-Universal Computation with DNA Polymers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space and Energy Efficient Computation with DNA Strand Displacement Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation and construction universality of reversible cellular automata / rank
 
Normal rank

Latest revision as of 18:59, 22 July 2024

scientific article; zbMATH DE number 7205932
Language Label Description Also known as
English
The Computing Power of Determinism and Reversibility in Chemical Reaction Automata
scientific article; zbMATH DE number 7205932

    Statements

    The Computing Power of Determinism and Reversibility in Chemical Reaction Automata (English)
    0 references
    0 references
    0 references
    28 May 2020
    0 references

    Identifiers