Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Nicolae Sântean / rank | |||
| Property / author | |||
| Property / author: Nicolae Sântean / rank | |||
Revision as of 15:57, 29 February 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
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
