Testing DNA code words properties of regular languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 826059 (Why is no real title available?)
- A formal language analysis of DNA hairpin structures
- An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words
- Codes, unambiguous automata and sofic systems.
- Codeword design and information encoding in DNA ensembles
- Coding properties of DNA languages.
- DNA Computing
- DNA Computing
- DNA computing. New computing paradigms.
- Developments in Language Theory
- Forms of determinism for automata
- Hairpin Structures in DNA Words
- On the Hairpin Completion of Regular Languages
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Cited in
(11)- scientific article; zbMATH DE number 1933226 (Why is no real title available?)
- Solution of a problem in DNA computing.
- Theoretical and implementational aspects of the formal language server (LaSer)
- DNA Codes and Their Properties
- scientific article; zbMATH DE number 1953217 (Why is no real title available?)
- 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
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)
