Reversible Two-Party Computations (Q6204131): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Inference of Reversible Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible parallel communicating finite automata systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible Watson-Crick automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watson-Crick pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the descriptional complexity of Watson-Crick automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Reversible Deterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of Reversibility for Classical Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Party Watson-Crick Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way reversible multi-head finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible Queue Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 5′ → 3′ Watson-Crick AutomataWith Several Runs / 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: On 5′→3′ Sensing Watson-Crick Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5016370 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:33, 29 August 2024

scientific article; zbMATH DE number 7828946
Language Label Description Also known as
English
Reversible Two-Party Computations
scientific article; zbMATH DE number 7828946

    Statements

    Reversible Two-Party Computations (English)
    0 references
    0 references
    0 references
    9 April 2024
    0 references

    Identifiers