Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: DNA sequence design using templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA computing. 9th international workshop on DNA based computers, DNA9, Madison, WI, USA, June 1--3, 2003. Revised papers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Coding Using the Subword Closure Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of Molecular Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA computing. 13th international meeting on DNA computing, DNA13, Memphis, TN, USA, June 4--8, 2007. Revised selected papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA computing. 7th international workshop on DNA-based computers, DNA7, Tampa, FL, USA, June 10--13, 2001. Revised papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / rank
 
Normal rank

Latest revision as of 15:08, 11 July 2024

scientific article
Language Label Description Also known as
English
Computing maximal Kleene closures that are embeddable in a given subword-closed language
scientific article

    Statements

    Computing maximal Kleene closures that are embeddable in a given subword-closed language (English)
    0 references
    0 references
    0 references
    10 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    automaton
    0 references
    code
    0 references
    DNA encodings
    0 references
    maximal
    0 references
    regular language
    0 references
    subword closure
    0 references
    0 references