Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (Q3092337): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1763698 |
||
| Property / author | |||
| Property / author: Nicolae Sântean / rank | |||
Revision as of 16:57, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language |
scientific article |
Statements
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (English)
0 references
16 September 2011
0 references
polynomial time algorithm
0 references
automaton
0 references
DNA encodings
0 references
regular language
0 references
structural characterization
0 references
subword closure
0 references
Kleene closure
0 references
