Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (Q3092337): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-23638-9_11 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W52186638 / rank | |||
Normal rank | |||
Revision as of 03:38, 20 March 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
