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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Nicolae Sântean / rank
Normal rank
 
Property / author
 
Property / author: Nicolae Sântean / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6553034 / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
automaton
Property / zbMATH Keywords: automaton / rank
 
Normal rank
Property / zbMATH Keywords
 
code
Property / zbMATH Keywords: code / rank
 
Normal rank
Property / zbMATH Keywords
 
DNA encodings
Property / zbMATH Keywords: DNA encodings / rank
 
Normal rank
Property / zbMATH Keywords
 
maximal
Property / zbMATH Keywords: maximal / rank
 
Normal rank
Property / zbMATH Keywords
 
regular language
Property / zbMATH Keywords: regular language / rank
 
Normal rank
Property / zbMATH Keywords
 
subword closure
Property / zbMATH Keywords: subword closure / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DNASequenceGenerator / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11047-013-9364-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077823020 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 14: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
    algorithm
    0 references
    automaton
    0 references
    code
    0 references
    DNA encodings
    0 references
    maximal
    0 references
    regular language
    0 references
    subword closure
    0 references

    Identifiers