Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709): 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/s11047-013-9364-y / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2077823020 / rank | |||
Normal rank |
Revision as of 20:43, 19 March 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