Computing maximal Kleene closures that are embeddable in a given subword-closed language

DOI10.1007/s11047-013-9364-yzbMath1332.68119MaRDI QIDQ256709

Stavros Konstantinidis, Nicolae Sântean

Publication date: 10 March 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-013-9364-y

zbMATH Keywords

algorithm; regular language; code; DNA encodings; automaton; maximal; subword closure

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

Uses Software

• DNASequenceGenerator