Testing DNA code words properties of regular languages

DOI10.1016/j.tcs.2015.08.034zbMath1332.68131OpenAlexW1769220744WikidataQ62039441 ScholiaQ62039441MaRDI QIDQ896711

Rosalba Zizza, Rocco Zaccagnino, Carlo Zottoli

Publication date: 10 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.034

zbMATH Keywords

automata theoryDNA computingformal languagesregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ Theoretical and implementational aspects of the formal language server (LaSer)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codeword design and information encoding in DNA ensembles
• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
• Coding properties of DNA languages.
• DNA computing. New computing paradigms.
• Codes, unambiguous automata and sofic systems.
• Forms of Determinism for Automata (Invited Talk)
• On the Hairpin Completion of Regular Languages
• Hairpin Structures in DNA Words
• An Easy Automata Based Algorithm for Testing Coding Properties of Infinite Sets of (DNA) Words
• Developments in Language Theory
• DNA Computing
• DNA Computing