Pages that link to "Item:Q3542872"

The following pages link to STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING (Q3542872):

Displayed 2 items.

• Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709) ‎ (← links)
• Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (Q3092337) ‎ (← links)