English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

This work concerns formal descriptions of DNA code properties, and builds onprevious work on transducer descriptions of classic code properties and ontrajectory descriptions of DNA code properties. This line of research allows usto give a property as input to an algorithm, in addition to any regularlanguage, which can then answer questions about the language and the property.Here we define DNA code properties via transducers and show that this method isstrictly more expressive than that of trajectories, without sacrificing theefficiency of deciding the satisfaction question. We also show that themaximality question can be undecidable. Our undecidability results hold notonly for the fixed DNA involution but also for any fixed antimorphicpermutation. Moreover, we also show the undecidability of the antimorphicversion of the Post Corresponding Problem, for any fixed antimorphicpermutation.

Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems