\(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter (Q6177182): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11047-021-09869-9 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11047-021-09869-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3196052876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a family of linear grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396577 / 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: 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: Linear Context Free Languages / 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: State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata / 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: Q5016370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA computing. New computing paradigms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine realization of the linear context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396006 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11047-021-09869-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:10, 30 December 2024

scientific article; zbMATH DE number 7732614
Language Label Description Also known as
English
\(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
scientific article; zbMATH DE number 7732614

    Statements

    \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter (English)
    0 references
    0 references
    0 references
    31 August 2023
    0 references
    Watson-Crick automata
    0 references
    \(5'\rightarrow 3'\) WK automata
    0 references
    finite automata
    0 references
    linear context-free languages
    0 references
    hierarchy
    0 references
    closure properties
    0 references
    sublinear languages
    0 references

    Identifiers