STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING

DOI10.1142/S0129054108006169zbMath1175.68242OpenAlexW2082796216MaRDI QIDQ3542872

Stavros Konstantinidis, Cezar Campeanu

Publication date: 1 December 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108006169

zbMATH Keywords

regular languagebalanced wordsDNA languagesgc-ratio

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Related Items (2)

Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language ⋮ Computing maximal Kleene closures that are embeddable in a given subword-closed language

Cites Work

• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• Unnamed Item

This page was built for publication: STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING