Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868): 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: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Landauer's principle, reversible computation, and Maxwell's demon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxwell's demon and the thermodynamics of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXORCIST XIV: the wrath of Maxwell's demon. II: From Szilard to Landauer and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5016363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Reversible Deterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of Reversibility for Classical Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible and Irreversible Computations of Deterministic Finite-State Devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connection between logical and thermodynamic irreversibility / 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: Reversible space equals deterministic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal and Reduced Reversible Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5016365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise representations of reversible automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eaters of the lotus: Landauer's principle and the return of Maxwell's demon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waiting for Landauer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information erasure without an energy cost / rank
 
Normal rank

Revision as of 14:22, 2 August 2024

scientific article; zbMATH DE number 7726984
Language Label Description Also known as
English
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
scientific article; zbMATH DE number 7726984

    Statements

    Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (English)
    0 references
    0 references
    0 references
    15 August 2023
    0 references
    reversible regular languages
    0 references
    reversible automaton
    0 references
    forbidden pattern
    0 references
    reduced reversible automaton
    0 references
    NL-completeness
    0 references
    descriptional complexity
    0 references

    Identifiers