Testing DNA code words properties of regular languages
From MaRDI portal
Publication:896711
DOI10.1016/J.TCS.2015.08.034zbMATH Open1332.68131OpenAlexW1769220744WikidataQ62039441 ScholiaQ62039441MaRDI QIDQ896711FDOQ896711
Authors: Rocco Zaccagnino, Rosalba Zizza, 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
Recommendations
Cites Work
- DNA Computing
- DNA Computing
- Title not available (Why is that?)
- Coding properties of DNA languages.
- A formal language analysis of DNA hairpin structures
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- On the Hairpin Completion of Regular Languages
- Hairpin Structures in DNA Words
- Developments in Language Theory
- DNA computing. New computing paradigms.
- Codeword design and information encoding in DNA ensembles
- Codes, unambiguous automata and sofic systems.
- Forms of determinism for automata
- An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words
- Title not available (Why is that?)
Cited In (11)
- Solution of a problem in DNA computing.
- Theoretical and implementational aspects of the formal language server (LaSer)
- DNA Codes and Their Properties
- Title not available (Why is that?)
- Toehold DNA languages are regular (extended abstract)
- Algorithms for testing that sets of DNA words concatenate without secondary structure
- An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words
- Language Forbidding-Enforcing Systems Defining DNA Codewords
- Generating DNA code words using forbidding and enforcing systems
- DNA Computing
- Title not available (Why is that?)
This page was built for publication: Testing DNA code words properties of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896711)
