Q6190440 (Q6190440): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: One-Way Jumping Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396577 / 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: Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / 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: Developments in Language Theory / 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: Transduced-input Automata with Translucent Letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: JUMPING 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: State-deterministic \(5'\rightarrow 3'\) Watson-Crick 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: On CD-systems of stateless deterministic R-automata with window size one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-head finite-state acceptors with translucent letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear automata with translucent letters and linear context-free trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5016370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396006 / rank
 
Normal rank

Latest revision as of 12:06, 26 August 2024

scientific article; zbMATH DE number 7800500
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7800500

    Statements

    0 references
    6 February 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references