Some properties of involution binary relations

DOI10.1007/s00236-014-0208-8zbMath1329.68174OpenAlexW2034198886MaRDI QIDQ493117

Cheng-Chih Huang, Chen-Ming Fan, Jen-Tse Wang

Publication date: 11 September 2015

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-014-0208-8

Mathematics Subject Classification ID

Combinatorics on words (68R15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20) Algebraic theory of languages and automata (68Q70)

Related Items

Transducer descriptions of DNA code properties and undecidability of antimorphic problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• DNA computing: Arrival of biological mathematics
• Coding properties of DNA languages.
• Pseudopalindrome closure operators in free monoids
• Dependences related to strict binary relations
• Some properties of involution palindrome languages
• Relations on free monoids, their independent sets, and codes¹
• DNA Codes and Their Properties
• Watson-Crick Conjugate and Commutative Words
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• DNA Computing
• Aspects of Molecular Computing