BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
From MaRDI portal
Publication:5704382
DOI10.1142/S0129054105003467zbMath1090.68046MaRDI QIDQ5704382
Lila Kari, Stavros Konstantinidis, Petr Sosík
Publication date: 14 November 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
k-involution codes and related sets, DNA Coding Using the Subword Closure Operation, Watson-Crick palindromes in DNA computing, Bond-free DNA language classes, STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
Cites Work