Transducer descriptions of DNA code properties and undecidability of antimorphic problems

DOI10.1016/j.ic.2017.09.004zbMath1390.68402arXiv1503.00035OpenAlexW2756098802MaRDI QIDQ1706156

Lila Kari, Steffen Kopecki, Stavros Konstantinidis

Publication date: 21 March 2018

Published in: Information and Computation, Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00035

zbMATH Keywords

trajectoriesundecidabilityDNA computingcodestransducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05)

Related Items (3)

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

Uses Software

• FAdo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some properties of involution binary relations
• Codes defined by multiple sets of trajectories
• Testing DNA code words properties of regular languages
• Coding properties of DNA languages.
• Transducer descriptions of DNA code properties and undecidability of antimorphic problems
• Aspects of shuffle and deletion on trajectories
• On properties of bond-free DNA languages
• Sticky-free and overhang-free DNA languages
• Trajectory-based codes
• Bond-free DNA language classes
• FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION
• Generating DNA Code Words Using Forbidding and Enforcing Systems
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• DNA Computing

This page was built for publication: Transducer descriptions of DNA code properties and undecidability of antimorphic problems