Trajectory-based codes

DOI10.1007/S00236-004-0140-4zbMath1094.68048OpenAlexW1978532382MaRDI QIDQ1889859

Michael Domaratzki

Publication date: 13 December 2004

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

Full work available at URL: https://doi.org/10.1007/s00236-004-0140-4

zbMATH Keywords

shuffle on trajectories

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION ⋮ Codes defined by multiple sets of trajectories ⋮ Algebraic properties of substitution on trajectories ⋮ On codes defined by bio-operations ⋮ On the maximality of languages with combined types of code properties ⋮ Decidability of involution hypercodes ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ Bond-free DNA language classes ⋮ OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS ⋮ Implementation of Code Properties via Transducers ⋮ Site-directed insertion: language equations and decision problems ⋮ Theoretical and implementational aspects of the formal language server (LaSer)

This page was built for publication: Trajectory-based codes